| Publication | Date of Publication | Type |
|---|
| Directed tangle tree-decompositions and applications | 2024-07-19 | Paper |
| A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups | 2024-02-23 | Paper |
| Packing even directed circuits quarter-integrally | 2023-11-28 | Paper |
| Improved distributed approximations for maximum independent set | 2023-11-02 | Paper |
| Decomposition of (infinite) digraphs along directed 1-separations | 2023-05-16 | Paper |
| Optimal distributed covering algorithms | 2023-03-14 | Paper |
| Optimal distributed covering algorithms | 2023-02-03 | Paper |
| Parameterized distributed algorithms | 2023-02-03 | Paper |
| Additive non-approximability of chromatic number in proper minor-closed classes | 2022-11-23 | Paper |
| Rooted topological minors on four vertices | 2022-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090928 | 2022-07-21 | Paper |
| A polynomial excluded-minor approximation of treedepth | 2022-03-29 | Paper |
| Additive non-approximability of chromatic number in proper minor-closed classes | 2021-07-28 | Paper |
| Isomorphisms of maps on the sphere | 2021-07-09 | Paper |
| Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set | 2021-03-15 | Paper |
| A nearly 5/3-approximation FPT Algorithm for Min-k-Cut | 2021-02-02 | Paper |
| The Directed Flat Wall Theorem | 2021-02-02 | Paper |
| Optimal Distributed Covering Algorithms | 2021-01-20 | Paper |
| Minimum Violation Vertex Maps and Their Applications to Cut Problems | 2020-12-04 | Paper |
| Quickly excluding a non-planar graph | 2020-10-23 | Paper |
| The canonical directed tree decomposition and its applications to the directed disjoint paths problem | 2020-09-28 | Paper |
| Model-Checking on Ordered Structures | 2020-09-11 | Paper |
| Automorphism groups of maps in linear time | 2020-08-04 | Paper |
| A half-integral Erd\H{o}s-P\'osa theorem for directed odd cycles | 2020-07-23 | Paper |
| Polylogarithmic approximation for Euler genus on bounded degree graphs | 2020-01-30 | Paper |
| Extreme-value-theoretic estimation of local intrinsic dimensionality | 2020-01-21 | Paper |
| Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor | 2020-01-15 | Paper |
| Polynomial Planar Directed Grid Theorem | 2019-10-15 | Paper |
| Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling | 2019-09-12 | Paper |
| An Excluded Grid Theorem for Digraphs with Forbidden Minors | 2019-06-20 | Paper |
| \(K_{6}\) minors in 6-connected graphs of bounded tree-width | 2019-06-17 | Paper |
| Totally odd subdivisions and parity subdivisions: Structures and Coloring | 2019-05-15 | Paper |
| A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– | 2019-05-15 | Paper |
| Packing directed cycles through a specified vertex set | 2019-05-15 | Paper |
| 4-connected projective-planar graphs are hamiltonian-connected | 2019-05-15 | Paper |
| More Compact Oracles for Approximate Distances in Undirected Planar Graphs | 2019-05-15 | Paper |
| 5-coloring K3,k-minor-free graphs | 2019-05-15 | Paper |
| List-coloring embedded graphs | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743513 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743487 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743429 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633930 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633929 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633932 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633933 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633931 | 2019-05-06 | Paper |
| Deterministic Edge Connectivity in Near-Linear Time | 2019-02-25 | Paper |
| A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds | 2019-01-30 | Paper |
| An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376371 | 2018-09-17 | Paper |
| All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs | 2018-08-03 | Paper |
| Coloring 3-Colorable Graphs with Less than n 1/5 Colors | 2018-08-02 | Paper |
| Tight Upper Bounds on the Crossing Number in a Minor-Closed Class | 2018-07-30 | Paper |
| The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs | 2018-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607893 | 2018-03-15 | Paper |
| \(K_{6}\) minors in large 6-connected graphs | 2018-02-09 | Paper |
| A new proof of the flat wall theorem | 2018-02-09 | Paper |
| FO model checking on map graphs | 2017-11-22 | Paper |
| Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable | 2017-09-11 | Paper |
| Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs | 2017-07-19 | Paper |
| Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes | 2017-07-03 | Paper |
| Matching Extension Missing Vertices and Edges in Triangulations of Surfaces | 2017-06-30 | Paper |
| Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs | 2017-05-24 | Paper |
| The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs | 2017-03-31 | Paper |
| The edge density of critical digraphs | 2017-03-31 | Paper |
| Coloring 3-colorable graphs with o(n 1/5 ) colors | 2017-03-03 | Paper |
| Coloring immersion-free graphs | 2016-10-12 | Paper |
| Hadwiger's conjecture | 2016-09-30 | Paper |
| Relative length of longest path and longest cycle | 2016-07-01 | Paper |
| Edge-disjoint odd cycles in 4-edge-connected graphs | 2016-04-21 | Paper |
| The Erdos-Posa Property for Directed Graphs | 2016-03-08 | Paper |
| Non-separating subgraphs in highly connected graphs | 2016-01-28 | Paper |
| 5-Connected Toroidal Graphs are Hamiltonian-Connected | 2016-01-15 | Paper |
| Packing six \(T\)-joins in plane graphs | 2015-12-11 | Paper |
| Graph Isomorphism for Bounded Genus Graphs In Linear Time | 2015-11-08 | Paper |
| Towards the Graph Minor Theorems for Directed Graphs | 2015-11-04 | Paper |
| Graph Theory and Sports Scheduling | 2015-10-14 | Paper |
| Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time | 2015-09-25 | Paper |
| Edge-colouring seven-regular planar graphs | 2015-08-21 | Paper |
| Beyond the Euler Characteristic | 2015-08-21 | Paper |
| The Directed Grid Theorem | 2015-08-21 | Paper |
| Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time | 2015-08-21 | Paper |
| The odd Hadwiger's conjecture is "almost decidable | 2015-08-17 | Paper |
| An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem | 2015-06-26 | Paper |
| Embedding and canonizing graphs of bounded genus in logspace | 2015-06-26 | Paper |
| Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) | 2015-06-10 | Paper |
| Fixed-parameter tractability for subset feedback set problems with parity constraints | 2015-05-18 | Paper |
| 4-connected projective-planar graphs are Hamiltonian-connected | 2015-05-04 | Paper |
| Half-integral packing of odd cycles through prescribed vertices | 2015-03-03 | Paper |
| Hadwiger's conjecture is decidable | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934714 | 2014-12-18 | Paper |
| An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs | 2014-12-05 | Paper |
| Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs | 2014-11-25 | Paper |
| Spanning closed walks and TSP in 3-connected planar graphs | 2014-10-22 | Paper |
| A simpler proof for the two disjoint odd cycles theorem | 2014-10-06 | Paper |
| Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture | 2014-10-06 | Paper |
| Three-coloring triangle-free planar graphs in linear time | 2014-09-09 | Paper |
| Removable paths and cycles with parity constraints | 2014-08-28 | Paper |
| A shorter proof of the graph minor algorithm: the unique linkage theorem | 2014-08-13 | Paper |
| Odd cycle packing | 2014-08-13 | Paper |
| Testing subdivision-freeness | 2014-08-07 | Paper |
| The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable | 2014-07-30 | Paper |
| The Graph Minor Algorithm with Parity Conditions | 2014-07-30 | Paper |
| A connected subgraph maintaining high connectivity | 2014-07-29 | Paper |
| Planarity Allowing Few Error Vertices in Linear Time | 2014-07-25 | Paper |
| An Approximation Algorithm for the Bipartite Traveling Tournament Problem | 2014-07-11 | Paper |
| Finding topological subgraphs is fixed-parameter tractable | 2014-06-05 | Paper |
| A simpler algorithm and shorter proof for the graph minor decomposition | 2014-06-05 | Paper |
| Contraction decomposition in h-minor-free graphs and algorithmic applications | 2014-06-05 | Paper |
| Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417628 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417629 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417627 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417631 | 2014-05-22 | Paper |
| Linkless and flat embeddings in 3-space and the unknot problem | 2014-04-03 | Paper |
| Minimum degree conditions for vertex-disjoint even cycles in large graphs | 2014-03-25 | Paper |
| Linkages in Large Graphs of Bounded Tree-Width | 2014-02-22 | Paper |
| High connectivity keeping connected subgraph | 2013-11-01 | Paper |
| Hamilton cycles in 4-connected troidal triangulations | 2013-11-01 | Paper |
| Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree | 2013-10-23 | Paper |
| Disjoint even cycles packing | 2013-10-10 | Paper |
| The Erdős-Lovász Tihany conjecture and complete minors | 2013-07-30 | Paper |
| Six-Critical Graphs on the Klein Bottle | 2013-06-28 | Paper |
| N-Flips in even triangulations on surfaces | 2013-06-28 | Paper |
| On the excluded minor structure theorem for graphs of large tree-width | 2013-01-14 | Paper |
| Packing Directed Circuits through Prescribed Vertices Bounded Fractionally | 2013-01-04 | Paper |
| Generating Approximate Solutions to the TTP using a Linear Distance Relaxation | 2012-12-03 | Paper |
| Minors in large almost-5-connected non-planar graphs | 2012-09-12 | Paper |
| Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid | 2012-08-23 | Paper |
| Edge-disjoint odd cycles in 4-edge-connected graphs | 2012-08-23 | Paper |
| Packing cycles through prescribed vertices under modularity constraints | 2012-08-14 | Paper |
| From the plane to higher surfaces | 2012-08-14 | Paper |
| Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem | 2012-08-14 | Paper |
| Linkless and flat embeddings in 3-space | 2012-05-22 | Paper |
| A multi-round generalization of the traveling tournament problem and its application to Japanese baseball | 2012-05-14 | Paper |
| A linear time algorithm for the induced disjoint paths problem in planar graphs | 2012-05-11 | Paper |
| Combinatorial coloring of 3-colorable graphs | 2012-05-06 | Paper |
| The disjoint paths problem in quadratic time | 2012-05-04 | Paper |
| The Erdős-Pósa property for clique minors in highly connected graphs | 2012-05-04 | Paper |
| An Improved Algorithm for the Half-Disjoint Paths Problem | 2012-03-15 | Paper |
| Contractible triples in highly connected graphs | 2012-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3112627 | 2012-01-12 | Paper |
| Minimally contraction-critically 6-connected graphs | 2012-01-11 | Paper |
| Non-separating even cycles in highly connected graphs | 2011-12-19 | Paper |
| Algorithms for finding an induced cycle in planar graphs | 2011-12-19 | Paper |
| Choosability of planar graphs of girth 5 | 2011-09-13 | Paper |
| 2- and 3-factors of graphs on surfaces | 2011-08-16 | Paper |
| Cliques in Odd-Minor-Free Graphs | 2011-08-15 | Paper |
| Packing cycles through prescribed vertices | 2011-08-10 | Paper |
| Toughness of \(K_{a,t}\)-minor-free graphs | 2011-07-29 | Paper |
| Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs | 2011-07-06 | Paper |
| The 2-extendability of 5-connected graphs on surfaces with large representativity | 2011-05-19 | Paper |
| Immersing small complete graphs | 2011-03-28 | Paper |
| Star Coloring and Acyclic Coloring of Locally Planar Graphs | 2011-03-15 | Paper |
| Non-separating subgraphs after deleting many disjoint paths | 2011-01-14 | Paper |
| Contractible small subgraphs in \(k\)-connected graphs | 2010-11-12 | Paper |
| A note on traversing specified vertices in graphs embedded with large representativity | 2010-10-18 | Paper |
| Improved algorithm for the half-disjoint paths problem | 2010-09-10 | Paper |
| An \(O(\log n)\)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs | 2010-09-10 | Paper |
| Highly parity linked graphs | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579485 | 2010-08-06 | Paper |
| Double-critical graphs and complete minors | 2010-06-16 | Paper |
| A simple algorithm for 4-coloring 3-colorable planar graphs | 2010-06-07 | Paper |
| 6-Critical Graphs on the Klein Bottle | 2010-03-17 | Paper |
| $K_6$-Minors in Triangulations on the Klein Bottle | 2010-03-17 | Paper |
| Dominating sets in triangulations on surfaces | 2010-03-15 | Paper |
| Bounding the size of equimatchable graphs of fixed genus | 2009-12-09 | Paper |
| Path factors in cubic graphs | 2009-12-08 | Paper |
| Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs | 2009-07-14 | Paper |
| List-coloring graphs without \(K_{4,k}\)-minors | 2009-06-30 | Paper |
| Linear connectivity forces large complete bipartite minors | 2009-06-23 | Paper |
| Decomposing a planar graph of girth 5 into an independent set and a forest | 2009-06-23 | Paper |
| Note on coloring graphs without odd-\(K_k\)-minors | 2009-06-23 | Paper |
| Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction | 2009-06-22 | Paper |
| A Weakening of the Odd Hadwiger's Conjecture | 2009-03-04 | Paper |
| Note on non-separating and removable cycles in highly connected graphs | 2009-03-04 | Paper |
| Linear connectivity forces large complete bipartite minors: [J. Combin. Theory ser. B vol. 99, issue 2] | 2009-03-04 | Paper |
| Improved upper bounds on the crossing number | 2009-02-12 | Paper |
| Long cycles in graphs without Hamiltonian paths | 2009-01-28 | Paper |
| Removable cycles in non-bipartite graphs | 2009-01-21 | Paper |
| \(N\)-flips in even triangulations on surfaces | 2009-01-21 | Paper |
| On the number of 4-contractible edges in 4-connected graphs | 2009-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549636 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549734 | 2009-01-05 | Paper |
| Locally planar graphs are 5-choosable | 2008-12-08 | Paper |
| Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs | 2008-12-05 | Paper |
| Some remarks on the odd Hadwiger's conjecture | 2008-10-22 | Paper |
| A weaker version of Lovász' path removal conjecture | 2008-10-07 | Paper |
| Approximating List-Coloring on a Fixed Surface | 2008-08-28 | Paper |
| Connectivity keeping edges in graphs with large minimum degree | 2008-07-24 | Paper |
| Chvátal Erdős condition and 2-factors with a specyfied number of components | 2008-06-18 | Paper |
| Contractible elements ink-connected graphs not containing some specified graphs | 2008-06-12 | Paper |
| The Induced Disjoint Paths Problem | 2008-06-10 | Paper |
| An Improved Algorithm for Finding Cycles Through Elements | 2008-06-10 | Paper |
| Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction | 2008-04-24 | Paper |
| Fractional coloring and the odd Hadwiger's conjecture | 2008-02-25 | Paper |
| Contractible edges in minimally \(k\)-connected graphs | 2008-01-28 | Paper |
| Independence number and clique minors | 2008-01-04 | Paper |
| On the matching extendability of graphs in surfaces | 2007-12-10 | Paper |
| A relaxed Hadwiger's conjecture for list colorings | 2007-06-08 | Paper |
| Non-zero disjoint cycles in highly connected group labeled graphs | 2007-05-29 | Paper |
| Vertices of degree 6 in a 6-contraction critical graph | 2007-05-29 | Paper |
| Some recent progress and applications in graph minor theory | 2007-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433932 | 2007-04-23 | Paper |
| 2-connected spanning subgraphs with low maximum degree in locally planar graphs | 2007-04-16 | Paper |
| The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces | 2007-03-02 | Paper |
| On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture | 2007-01-11 | Paper |
| Chords of longest circuits in locally planar graphs | 2006-12-07 | Paper |
| On Sufficient Degree Conditions for a Graph to be $k$-linked | 2006-12-05 | Paper |
| Domination in a graph with a 2‐factor | 2006-06-06 | Paper |
| A pair of forbidden subgraphs and perfect matchings. | 2006-05-18 | Paper |
| Non-zero disjoint cycles in highly connected group labelled graphs | 2006-04-28 | Paper |
| Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor | 2006-01-26 | Paper |
| Existence of two disjoint long cycles in graphs | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708572 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708555 | 2005-11-18 | Paper |
| Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture | 2005-09-28 | Paper |
| Orientable and Nonorientable Genera for Some Complete Tripartite Graphs | 2005-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461555 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461493 | 2005-07-26 | Paper |
| Graph minors and linkages | 2005-06-01 | Paper |
| On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs | 2005-05-23 | Paper |
| Vertices of degree 5 in a contraction critically 5-connected graph | 2005-05-12 | Paper |
| Non-separating paths in 4-connected graphs | 2005-04-28 | Paper |
| Acute triangles in 4-connected maximal plane graphs | 2005-04-28 | Paper |
| Detecting even holes | 2005-04-21 | Paper |
| Vertex-disjoint copies of K4- | 2005-04-15 | Paper |
| On the structure of \(k\)-connected graphs without \(K_{k}\)-minor | 2005-03-08 | Paper |
| Rooted minor problems in highly connected graphs | 2004-11-18 | Paper |
| A theorem on paths in locally planar triangulations | 2004-10-04 | Paper |
| Vertex-disjoint cycles containing specified vertices in a bipartite graph | 2004-08-04 | Paper |
| Cycles through a prescribed vertex set in \(n\)-connected graphs. | 2004-03-14 | Paper |
| K-linked graphs with girth condition | 2004-02-03 | Paper |
| Subgraphs of graphs on surfaces with high representativity | 2004-01-06 | Paper |
| Vertices of degree 6 in a contraction critically 6-connected graph | 2004-01-05 | Paper |
| Covering vertices of a graph by \(k\) disjoint cycles | 2003-09-04 | Paper |
| Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge | 2003-06-25 | Paper |
| On two equimatchable graph classes | 2003-06-09 | Paper |
| Cycles having the same modularity and removable edges in 2-connected graphs | 2003-05-25 | Paper |
| 2-connected 7-coverings of 3-connected graphs on surfaces | 2003-05-22 | Paper |
| Contractible edges and triangles in \(k\)-connected graphs | 2002-12-10 | Paper |
| One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture | 2002-12-10 | Paper |
| On separable self-complementary graphs | 2002-12-02 | Paper |
| On a Hamiltonian cycle in which specified vertices are not isolated | 2002-12-02 | Paper |
| K4−‐factor in a graph | 2002-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547810 | 2002-08-21 | Paper |
| A survey on Hamiltonian cycles | 2002-07-14 | Paper |
| Hamiltonian cycles in n‐extendable graphs | 2002-07-11 | Paper |
| Graph partition into paths containing specified vertices | 2002-05-28 | Paper |
| Hamiltonian cycles in \(n\)-factor-critical graphs | 2002-04-16 | Paper |
| Path factors in claw-free graphs | 2002-03-13 | Paper |
| Vertex-disjoint cycles containing specified edges in a bipartite graph | 2002-01-21 | Paper |
| Note on \(k\)-contractible edges in \(k\)-connected graphs | 2002-01-02 | Paper |
| A note on Hamiltonian cycles in \((k,n)\)-factor-critical graphs | 2001-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4514553 | 2001-03-30 | Paper |
