| Publication | Date of Publication | Type |
|---|
Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
On upward-planar L-drawings of graphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
Planar drawings with few slopes of Halin graphs and nested pseudotrees
Algorithmica | 2024-08-13 | Paper |
| On upward-planar L-drawings of graphs | 2024-08-06 | Paper |
Edge-minimum saturated \(k\)-planar drawings
Journal of Graph Theory | 2024-07-02 | Paper |
Bounding and computing obstacle numbers of graphs
SIAM Journal on Discrete Mathematics | 2024-05-22 | Paper |
| Parameterized algorithms for upward planarity | 2024-05-14 | Paper |
| Snakes and Ladders: A Treewidth Story | 2024-05-03 | Paper |
| Planar L-drawings of directed graphs | 2023-12-16 | Paper |
Recognizing Proper Tree-Graphs
(available as arXiv preprint) | 2023-11-13 | Paper |
scientific article; zbMATH DE number 7759289 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Morphing triangle contact representations of triangulations
Discrete & Computational Geometry | 2023-10-12 | Paper |
The Complexity of Drawing Graphs on Few Lines and Few Planes
Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
Morphing rectangular duals
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Testing upward planarity of partial 2-trees
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Intersection graphs of non-crossing paths
Discrete Mathematics | 2023-05-31 | Paper |
Extending partial representations of rectangular duals with given contact orientations
(available as arXiv preprint) | 2023-03-22 | Paper |
Planar L-drawings of bimodal graphs
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Query minimization under stochastic uncertainty
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
Morphing Contact Representations of Graphs
(available as arXiv preprint) | 2022-07-18 | Paper |
Edge-minimum saturated \(k\)-planar drawings
(available as arXiv preprint) | 2022-07-01 | Paper |
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
Theoretical Computer Science | 2022-05-10 | Paper |
| Generalized disk graphs | 2022-03-25 | Paper |
Planar drawings with few slopes of Halin graphs and nested pseudotrees
(available as arXiv preprint) | 2022-03-25 | Paper |
Planar L-Drawings of Bimodal Graphs
Lecture Notes in Computer Science | 2021-12-01 | Paper |
On \(H\)-topological intersection graphs
Algorithmica | 2021-11-19 | Paper |
Query minimization under stochastic uncertainty
Theoretical Computer Science | 2021-11-18 | Paper |
Query minimization under stochastic uncertainty
Theoretical Computer Science | 2021-11-18 | Paper |
scientific article; zbMATH DE number 7378687 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| scientific article; zbMATH DE number 7376034 (Why is no real title available?) | 2021-07-28 | Paper |
Kernelization of graph Hamiltonicity: proper \(H\)-graphs
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
Recognizing stick graphs with and without length constraints
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
Bundled crossings revisited
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
Edge-Minimum Saturated k-Planar Drawings
(available as arXiv preprint) | 2020-12-15 | Paper |
Placing your coins on a shelf
(available as arXiv preprint) | 2020-11-25 | Paper |
| Drawing graphs on few lines and few planes | 2020-11-12 | Paper |
On arrangements of orthogonal circles
(available as arXiv preprint) | 2020-10-26 | Paper |
Stick graphs with length constraints
(available as arXiv preprint) | 2020-10-26 | Paper |
Bundled crossings revisited
(available as arXiv preprint) | 2020-10-26 | Paper |
On independent set in \(B_1\)-EPG graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
Intersection graphs of non-crossing paths
(available as arXiv preprint) | 2020-02-24 | Paper |
| Kernelization of graph Hamiltonicity: proper \(H\)-graphs | 2020-01-16 | Paper |
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Computational Geometry | 2019-10-25 | Paper |
Extending partial representations of circle graphs
Journal of Graph Theory | 2019-08-15 | Paper |
Placing your coins on a shelf
(available as arXiv preprint) | 2019-02-27 | Paper |
Beyond outerplanarity
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Planar L-drawings of directed graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
On vertex- and empty-ply proximity drawings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Lecture Notes in Computer Science | 2019-02-15 | Paper |
On some graphs with a unique perfect matching
Information Processing Letters | 2018-10-19 | Paper |
Grid intersection graphs and order dimension
Order | 2018-07-27 | Paper |
The partial visibility representation extension problem
Algorithmica | 2018-07-25 | Paper |
On the structure of (pan, even hole)-free graphs
Journal of Graph Theory | 2018-02-23 | Paper |
Combinatorial problems on \(H\)-graphs
(available as arXiv preprint) | 2018-01-18 | Paper |
On \(H\)-topological intersection graphs
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
The complexity of drawing graphs on few lines and few planes
(available as arXiv preprint) | 2017-09-22 | Paper |
Obstructing visibilities with one obstacle
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing Graphs on Few Lines and Few Planes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing Graphs on Few Lines and Few Planes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Simultaneous orthogonal planarity
Lecture Notes in Computer Science | 2017-02-21 | Paper |
The partial visibility representation extension problem
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Threshold-coloring and unit-cube contact representation of planar graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Max point-tolerance graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Ferrers dimension of grid intersection graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
A note on concurrent graph sharing games
Integers | 2016-10-28 | Paper |
A note on concurrent graph sharing games
Integers | 2016-10-28 | Paper |
Edge intersection graphs of \(L\)-shaped paths in grids
Discrete Applied Mathematics | 2016-06-22 | Paper |
Contact representations of planar graphs: extending a partial representation is hard
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Theoretical Computer Science | 2015-06-10 | Paper |
Intersection dimension of bipartite graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
The vertex leafage of chordal graphs
Discrete Applied Mathematics | 2014-04-02 | Paper |
Extending partial representations of circle graphs
Graph Drawing | 2013-12-20 | Paper |
Equilateral L-contact graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Threshold-coloring and unit-cube contact representation of graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Planar graphs as VPG-graphs
Journal of Graph Algorithms and Applications | 2013-08-13 | Paper |
Planar graphs as VPG-graphs
Graph Drawing | 2013-04-03 | Paper |
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
From path graphs to directed path graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Bounding and computing obstacle numbers of graphs
(available as arXiv preprint) | N/A | Paper |
