| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6192474 | 2024-02-12 | Paper |
| On colourability of polygon visibility graphs | 2024-01-23 | Paper |
| Inserting Multiple Edges into a Planar Graph | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168434 | 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 | 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 | 2023-02-16 | Paper |
| Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) | 2023-01-23 | Paper |
| Clique-width of point configurations | 2022-12-21 | Paper |
| Clique-width of point configurations | 2022-11-23 | Paper |
| Twin-width of Planar Graphs is at most 8, and some Related Bounds | 2022-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088941 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089162 | 2022-07-18 | Paper |
| Isomorphism testing for \(T\)-graphs in FPT | 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 | 2020-11-25 | Paper |
| Exact crossing number parameterized by vertex cover | 2020-10-26 | Paper |
| A New Perspective on FO Model Checking of Dense Graph Classes | 2020-09-11 | Paper |
| Structure and generation of crossing-critical graphs | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111878 | 2020-05-27 | Paper |
| On conflict-free chromatic guarding of simple polygons | 2020-05-13 | Paper |
| Toroidal grid minors and stretch in embedded graphs | 2020-01-15 | Paper |
| Exact Crossing Number Parameterized by Vertex Cover | 2019-06-14 | Paper |
| On degree properties of crossing-critical families of graphs | 2019-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4625695 | 2019-02-25 | Paper |
| Parameterized shifted combinatorial optimization | 2018-12-10 | Paper |
| FO model checking on geometric graphs | 2018-12-07 | Paper |
| Parameterized extension complexity of independent set and related problems | 2018-09-17 | Paper |
| Deciding Parity of Graph Crossing Number | 2018-08-07 | Paper |
| A Simpler Self-reduction Algorithm for Matroid Path-Width | 2018-06-25 | Paper |
| A New Perspective on FO Model Checking of Dense Graph Classes | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4610040 | 2018-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132864 | 2018-01-30 | Paper |
| Crossing Number is Hard for Kernelization | 2018-01-30 | Paper |
| Parameterized shifted combinatorial optimization | 2017-10-23 | Paper |
| First order limits of sparse graphs: Plane trees and path-width | 2017-08-10 | Paper |
| A tighter insertion-based approximation of the crossing number | 2017-08-03 | Paper |
| Shrub-depth: Capturing Height of Dense Graphs | 2017-07-02 | Paper |
| On Degree Properties of Crossing-Critical Families of Graphs | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957485 | 2017-01-26 | Paper |
| A Short Proof of Euler--Poincar\'e Formula | 2016-12-05 | Paper |
| Kernelization using structural parameters on sparse graph classes | 2016-11-14 | Paper |
| Tree-depth and vertex-minors | 2016-05-11 | Paper |
| On Hardness of the Joint Crossing Number | 2016-01-11 | Paper |
| Faster Existential FO Model Checking on Posets | 2016-01-07 | Paper |
| FO Model Checking of Interval Graphs | 2016-01-07 | Paper |
| Are there any good digraph width measures? | 2015-12-11 | Paper |
| Faster Existential FO Model Checking on Posets | 2015-09-11 | Paper |
| Planar emulators conjecture is nearly true for cubic graphs | 2015-06-02 | Paper |
| Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences | 2015-04-22 | Paper |
| Computing the Stretch of an Embedded Graph | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419973 | 2014-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417677 | 2014-05-22 | Paper |
| Digraph width measures in parameterized algorithmics | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403059 | 2014-03-25 | Paper |
| Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking | 2014-01-28 | Paper |
| Kernelization Using Structural Parameters on Sparse Graph Classes | 2013-09-17 | Paper |
| FO Model Checking of Interval Graphs | 2013-08-07 | Paper |
| Stars and Bonds in Crossing-Critical Graphs | 2013-06-28 | Paper |
| Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width | 2013-04-18 | Paper |
| A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width | 2013-01-24 | Paper |
| How not to characterize planar-emulable graphs | 2013-01-14 | Paper |
| When Trees Grow Low: Shrubs and Fast MSO1 | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908838 | 2012-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904773 | 2012-08-23 | Paper |
| Vertex insertion approximates the crossing number of apex graphs | 2012-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113705 | 2012-01-23 | Paper |
| How Not to Characterize Planar-Emulable Graphs | 2012-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3104253 | 2011-12-19 | Paper |
| Scope-Based Route Planning | 2011-09-16 | Paper |
| A tighter insertion-based approximation of the crossing number | 2011-07-06 | Paper |
| Stars and bonds in crossing-critical graphs | 2011-01-19 | Paper |
| Are There Any Good Digraph Width Measures? | 2010-12-07 | Paper |
| 20 years of Negami's planar cover conjecture | 2010-11-12 | Paper |
| On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width | 2010-05-25 | Paper |
| New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes | 2010-01-28 | Paper |
| On Digraph Width Measures in Parameterized Algorithmics | 2010-01-14 | Paper |
| Better Polynomial Algorithms on Graphs of Bounded Rank-Width | 2009-12-11 | Paper |
| Finding Branch-Decompositions and Rank-Decompositions | 2009-06-22 | Paper |
| Addendum to matroid tree-width | 2009-06-17 | Paper |
| The crossing number of a projective graph is quadratic in the face-width | 2009-04-07 | Paper |
| New infinite families of almost-planar crossing-critical graphs | 2009-04-07 | Paper |
| Approximating the Crossing Number of Apex Graphs | 2009-03-03 | Paper |
| Finding Branch-Decompositions and Rank-Decompositions | 2008-09-25 | Paper |
| The crossing number of a projective graph is quadratic in the face–width | 2008-06-05 | Paper |
| Approximating the Crossing Number of Toroidal Graphs | 2008-05-27 | Paper |
| Some hard problems on matroid spikes | 2007-12-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width | 2007-11-16 | Paper |
| On Matroid Representability and Minor Problems | 2007-09-05 | Paper |
| On the Crossing Number of Almost Planar Graphs | 2007-08-28 | Paper |
| Balanced Signings and the Chromatic Number of Oriented Matroids | 2007-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3410102 | 2006-11-21 | Paper |
| Matroid tree-width | 2006-11-15 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Crossing number is hard for cubic graphs | 2006-07-12 | Paper |
| The Tutte Polynomial for Matroids of Bounded Branch-Width | 2006-07-06 | Paper |
| Equivalence-free exhaustive generation of matroid representations | 2006-06-30 | Paper |
| A Parametrized Algorithm for Matroid Branch-Width | 2006-06-01 | Paper |
| Branch-width, parse trees, and monadic second-order logic for matroids. | 2006-05-18 | Paper |
| Trees, grids, and MSO decidability: from graphs to matroids | 2006-04-06 | Paper |
| Bridging Separations in Matroids | 2005-09-16 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4669912 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043709 | 2004-08-06 | Paper |
| On possible counterexamples to Negami's planar cover conjecture | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450567 | 2004-02-15 | Paper |
| Crossing-number critical graphs have bounded path-width | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418660 | 2003-08-11 | Paper |
| On the excluded minors for matroids of branch-width three | 2002-09-22 | Paper |
| Another two graphs with no planar covers | 2002-09-11 | Paper |
| An addition to art galleries with interior walls | 2002-05-29 | Paper |
| Contact graphs of line segments are NP-complete | 2002-03-29 | Paper |
| Representing graphs by disks and balls (a survey of recognition-complexity results) | 2001-10-07 | Paper |
| Classes and recognition of curve contact graphs | 2000-09-05 | Paper |
| A note on possible extensions of Negami's conjecture | 2000-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373683 | 1998-06-11 | Paper |
| The maximal clique and colourability of curve contact graphs | 1998-03-25 | Paper |
| K4,4 ?e has no finite planar cover | 1998-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852552 | 1996-05-30 | Paper |
