scientific article; zbMATH DE number 7525517
From MaRDI portal
Publication:5075828
DOI10.4230/LIPIcs.ESA.2019.80MaRDI QIDQ5075828
Michael Vollmer, Darren Strash, Ignaz Rutter, Peter Stumpf
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1908.08882
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Partial and simultaneous transitive orientations via modular decompositions
Cites Work
- Unnamed Item
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Extending partial representations of proper and unit interval graphs
- A linear-time algorithm for proper interval graph recognition
- On simultaneous planar graph embeddings
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Efficient graph representations
- Algorithmic graph theory and perfect graphs
- Optimal greedy algorithms for indifference graphs
- Recognition of probe proper interval graphs
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
- Extending Partial Representations of Circle Graphs
- Simultaneous Interval Graphs
- Simultaneous Graph Embeddings with Fixed Edges
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Graph Sandwich Problems
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Simultaneous Geometric Graph Embeddings
- On Some $\mathcal{NP}$ -complete SEFE Problems
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
- Linear-Time Recognition of Probe Interval Graphs
This page was built for publication:
