| Publication | Date of Publication | Type |
|---|
Graph product structure for \(h\)-framed graphs
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
| Recognizing \(H\)-graphs -- beyond circular-arc graphs | 2024-12-03 | Paper |
| Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar | 2024-11-14 | Paper |
On the achievable average degrees in 2-crossing-critical graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| On 13-crossing-critical graphs with arbitrarily large degrees | 2024-09-13 | Paper |
| A short proof of Euler-Poincaré formula | 2024-09-13 | Paper |
| Graph product structure for \(h\)-framed graphs | 2024-09-11 | Paper |
Twin-width and transductions of proper \(k\)-mixed-thin graphs
Discrete Mathematics | 2024-06-10 | Paper |
| Parameterised partially-predrawn crossing number | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7803584 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-12 | Paper |
On colourability of polygon visibility graphs
European Journal of Combinatorics | 2024-01-23 | Paper |
Inserting Multiple Edges into a Planar Graph
Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
scientific article; zbMATH DE number 7724194 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
| Sparse Graphs of Twin-width 2 Have Bounded Tree-width | 2023-07-04 | Paper |
| Minimizing an Uncrossed Collection of Drawings | 2023-06-15 | Paper |
Twin-width and transductions of proper \(k\)-mixed-thin graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Stack and Queue Numbers of Graphs Revisited | 2023-03-17 | Paper |
| Twin-width of Planar Graphs; a Short Proof | 2023-02-17 | Paper |
Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
Algorithmica | 2023-02-16 | Paper |
Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)
Combinatorica | 2023-01-23 | Paper |
Clique-width of point configurations
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Clique-width of point configurations
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
| Twin-width of Planar Graphs is at most 8, and some Related Bounds | 2022-10-16 | Paper |
scientific article; zbMATH DE number 7559214 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559375 (Why is no real title available?) | 2022-07-18 | Paper |
Isomorphism testing for \(T\)-graphs in FPT
(available as arXiv preprint) | 2022-07-13 | Paper |
| Twin-width of Planar Graphs is at most 9, and at most 6 when Bipartite Planar | 2022-05-11 | Paper |
| Graph Product Structure for h-Framed Graphs | 2022-04-25 | Paper |
| Automorphisms of Set Families and of Families of Cliques in an Interval Graph in FPT Time | 2022-02-25 | Paper |
On colourability of polygon visibility graphs
(available as arXiv preprint) | 2020-11-25 | Paper |
Exact crossing number parameterized by vertex cover
(available as arXiv preprint) | 2020-10-26 | Paper |
A new perspective on FO model checking of dense graph classes
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Structure and generation of crossing-critical graphs
(available as arXiv preprint) | 2020-08-18 | Paper |
| FO model checking of geometric graphs | 2020-05-27 | Paper |
On conflict-free chromatic guarding of simple polygons
(available as arXiv preprint) | 2020-05-13 | Paper |
Toroidal grid minors and stretch in embedded graphs
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Exact Crossing Number Parameterized by Vertex Cover
(available as arXiv preprint) | 2019-06-14 | Paper |
On degree properties of crossing-critical families of graphs
The Electronic Journal of Combinatorics | 2019-03-22 | Paper |
scientific article; zbMATH DE number 7029306 (Why is no real title available?)
(available as arXiv preprint) | 2019-02-25 | Paper |
Parameterized shifted combinatorial optimization
Journal of Computer and System Sciences | 2018-12-10 | Paper |
FO model checking on geometric graphs
Computational Geometry | 2018-12-07 | Paper |
FO model checking on geometric graphs
Computational Geometry | 2018-12-07 | Paper |
Parameterized extension complexity of independent set and related problems
Discrete Applied Mathematics | 2018-09-17 | Paper |
Deciding Parity of Graph Crossing Number
SIAM Journal on Discrete Mathematics | 2018-08-07 | Paper |
A simpler self-reduction algorithm for matroid path-width
SIAM Journal on Discrete Mathematics | 2018-06-25 | Paper |
A new perspective on FO model checking of dense graph classes
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| scientific article; zbMATH DE number 6856239 (Why is no real title available?) | 2018-04-05 | Paper |
Inserting multiple edges into a planar graph
(available as arXiv preprint) | 2018-01-30 | Paper |
Crossing number is hard for kernelization
(available as arXiv preprint) | 2018-01-30 | Paper |
Parameterized shifted combinatorial optimization
Lecture Notes in Computer Science | 2017-10-23 | Paper |
First order limits of sparse graphs: plane trees and path-width
Random Structures & Algorithms | 2017-08-10 | Paper |
First order limits of sparse graphs: plane trees and path-width
Random Structures & Algorithms | 2017-08-10 | Paper |
A tighter insertion-based approximation of the crossing number
Journal of Combinatorial Optimization | 2017-08-03 | Paper |
Shrub-depth: Capturing Height of Dense Graphs
(available as arXiv preprint) | 2017-07-02 | Paper |
On Degree Properties of Crossing-Critical Families of Graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
| scientific article; zbMATH DE number 6678444 (Why is no real title available?) | 2017-01-26 | Paper |
| A Short Proof of Euler--Poincar\'e Formula | 2016-12-05 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Tree-depth and vertex-minors
European Journal of Combinatorics | 2016-05-11 | Paper |
On hardness of the joint crossing number
Algorithms and Computation | 2016-01-11 | Paper |
Faster existential FO model checking on posets
Logical Methods in Computer Science | 2016-01-07 | Paper |
FO model checking of interval graphs
Logical Methods in Computer Science | 2016-01-07 | Paper |
Are there any good digraph width measures?
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Faster existential FO model checking on posets
Algorithms and Computation | 2015-09-11 | Paper |
Planar emulators conjecture is nearly true for cubic graphs
European Journal of Combinatorics | 2015-06-02 | Paper |
Kernelizing MSO properties of trees of fixed height, and some consequences
Logical Methods in Computer Science | 2015-04-22 | Paper |
Computing the stretch of an embedded graph
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
| scientific article; zbMATH DE number 6302995 (Why is no real title available?) | 2014-06-11 | Paper |
| Approximating the crossing number of graphs embeddable in any orientable surface | 2014-05-22 | Paper |
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics | 2014-04-02 | Paper |
| Parameterized problems related to Seidel's switching | 2014-03-25 | Paper |
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Kernelization using structural parameters on sparse graph classes
Lecture Notes in Computer Science | 2013-09-17 | Paper |
FO model checking of interval graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Stars and Bonds in Crossing-Critical Graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae | 2013-04-18 | Paper |
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
European Journal of Combinatorics | 2013-01-24 | Paper |
How not to characterize planar-emulable graphs
Advances in Applied Mathematics | 2013-01-14 | Paper |
When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
| Better algorithms for satisfiability problems for formulas of bounded rank-width | 2012-08-29 | Paper |
| Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking | 2012-08-23 | Paper |
Vertex insertion approximates the crossing number of apex graphs
European Journal of Combinatorics | 2012-02-11 | Paper |
| Clique-width: when hard does not mean impossible | 2012-01-23 | Paper |
How not to characterize planar-emulable graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
| Automata approach to graphs of bounded rank-width | 2011-12-19 | Paper |
Scope-based route planning
Algorithms – ESA 2011 | 2011-09-16 | Paper |
A tighter insertion-based approximation of the crossing number
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Stars and bonds in crossing-critical graphs
Journal of Graph Theory | 2011-01-19 | Paper |
Are there any good digraph width measures?
Parameterized and Exact Computation | 2010-12-07 | Paper |
20 years of Negami's planar cover conjecture
Graphs and Combinatorics | 2010-11-12 | Paper |
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics | 2010-05-25 | Paper |
New results on the complexity of oriented colouring on restricted digraph classes
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
On digraph width measures in parameterized algorithmics
Parameterized and Exact Computation | 2010-01-14 | Paper |
Better polynomial algorithms on graphs of bounded rank-width
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing | 2009-06-22 | Paper |
Addendum to matroid tree-width
European Journal of Combinatorics | 2009-06-17 | Paper |
The crossing number of a projective graph is quadratic in the face-width
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The crossing number of a projective graph is quadratic in the face-width
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
New infinite families of almost-planar crossing-critical graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
New infinite families of almost-planar crossing-critical graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Approximating the Crossing Number of Apex Graphs
Graph Drawing | 2009-03-03 | Paper |
Finding Branch-Decompositions and Rank-Decompositions
Algorithms – ESA 2007 | 2008-09-25 | Paper |
The crossing number of a projective graph is quadratic in the face–width
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Approximating the Crossing Number of Toroidal Graphs
Algorithms and Computation | 2008-05-27 | Paper |
Some hard problems on matroid spikes
Theory of Computing Systems | 2007-12-19 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
On Matroid Representability and Minor Problems
Lecture Notes in Computer Science | 2007-09-05 | Paper |
On the Crossing Number of Almost Planar Graphs
Graph Drawing | 2007-08-28 | Paper |
Balanced Signings and the Chromatic Number of Oriented Matroids
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
| Combinatorial generation of matroid representations: theory and practice | 2006-11-21 | Paper |
Matroid tree-width
European Journal of Combinatorics | 2006-11-15 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Crossing number is hard for cubic graphs
Journal of Combinatorial Theory. Series B | 2006-07-12 | Paper |
The Tutte Polynomial for Matroids of Bounded Branch-Width
Combinatorics, Probability and Computing | 2006-07-06 | Paper |
Equivalence-free exhaustive generation of matroid representations
Discrete Applied Mathematics | 2006-06-30 | Paper |
A Parametrized Algorithm for Matroid Branch-Width
SIAM Journal on Computing | 2006-06-01 | Paper |
Branch-width, parse trees, and monadic second-order logic for matroids.
Journal of Combinatorial Theory. Series B | 2006-05-18 | Paper |
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science | 2006-04-06 | Paper |
Bridging Separations in Matroids
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2157324 (Why is no real title available?) | 2005-04-15 | Paper |
| scientific article; zbMATH DE number 2084270 (Why is no real title available?) | 2004-08-06 | Paper |
On possible counterexamples to Negami's planar cover conjecture
Journal of Graph Theory | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2042724 (Why is no real title available?) | 2004-02-15 | Paper |
Crossing-number critical graphs have bounded path-width
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962824 (Why is no real title available?) | 2003-08-11 | Paper |
On the excluded minors for matroids of branch-width three
The Electronic Journal of Combinatorics | 2002-09-22 | Paper |
Another two graphs with no planar covers
Journal of Graph Theory | 2002-09-11 | Paper |
An addition to art galleries with interior walls
Discrete & Computational Geometry | 2002-05-29 | Paper |
Contact graphs of line segments are NP-complete
Discrete Mathematics | 2002-03-29 | Paper |
Representing graphs by disks and balls (a survey of recognition-complexity results)
Discrete Mathematics | 2001-10-07 | Paper |
Classes and recognition of curve contact graphs
Journal of Combinatorial Theory. Series B | 2000-09-05 | Paper |
| A note on possible extensions of Negami's conjecture | 2000-04-09 | Paper |
| scientific article; zbMATH DE number 1107734 (Why is no real title available?) | 1998-06-11 | Paper |
The maximal clique and colourability of curve contact graphs
Discrete Applied Mathematics | 1998-03-25 | Paper |
| K4,4 ?e has no finite planar cover | 1998-03-15 | Paper |
| scientific article; zbMATH DE number 811559 (Why is no real title available?) | 1996-05-30 | Paper |
On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees
(available as arXiv preprint) | N/A | Paper |
Note on k-Planar and Min-k-Planar Drawings of Graphs
(available as arXiv preprint) | N/A | Paper |
H-Clique-Width and a Hereditary Analogue of Product Structure
(available as arXiv preprint) | N/A | Paper |
