| Publication | Date of Publication | Type |
|---|
| Greedily finding a dense subgraph | 2022-12-09 | Paper |
| Experimental Analysis of Treewidth | 2022-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111757 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111885 | 2020-05-27 | Paper |
| Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs | 2019-09-11 | Paper |
| Positive-instance driven dynamic programming for treewidth | 2019-06-25 | Paper |
| Optimal branch-decomposition of planar graphs in O ( n 3 ) Time | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634401 | 2018-04-10 | Paper |
| Fast deflection routing for packets and worms | 2017-09-29 | Paper |
| On the fault tolerance of the butterfly | 2016-09-01 | Paper |
| Computing directed pathwidth in \(O(1.89^n)\) time | 2016-06-28 | Paper |
| A faster fixed parameter algorithm for two-layer crossing minimization | 2016-05-18 | Paper |
| On the Pathwidth of Almost Semicomplete Digraphs | 2015-11-19 | Paper |
| A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization | 2015-09-02 | Paper |
| A linear edge kernel for two-layer crossing minimization | 2014-10-06 | Paper |
| A Linear Edge Kernel for Two-Layer Crossing Minimization | 2013-06-11 | Paper |
| Route-enabling graph orientation problems | 2013-03-05 | Paper |
| Improved bounds on the planar branchwidth with respect to the largest grid minor size | 2013-01-28 | Paper |
| Computing Directed Pathwidth in O(1.89 n ) Time | 2013-01-07 | Paper |
| A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization | 2012-09-25 | Paper |
| A Polynomial Time Algorithm for Bounded Directed Pathwidth | 2011-12-16 | Paper |
| Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time | 2011-07-27 | Paper |
| The Structure and Number of Global Roundings of a Graph | 2011-03-18 | Paper |
| k-cyclic Orientations of Graphs | 2010-12-09 | Paper |
| Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size | 2010-12-09 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Route-Enabling Graph Orientation Problems | 2009-12-17 | Paper |
| Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time | 2009-12-17 | Paper |
| Voronoi diagrams with respect to criteria on vision information | 2008-09-25 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Matching algorithms are fast in sparse random graphs | 2006-10-25 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| On the probability of rendezvous in graphs | 2005-06-01 | Paper |
| Noise-tolerant distribution-free learning of general geometric concepts | 2005-01-25 | Paper |
| The structure and number of global roundings of a graph | 2004-10-27 | Paper |
| PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS | 2004-09-29 | Paper |
| Spanning trees crossing few barriers | 2004-02-05 | Paper |
| A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms | 2003-08-19 | Paper |
| A characterization of planar graphs by pseudo-line arrangements | 2003-08-17 | Paper |
| Enumeration of success patterns in logic programs | 2002-05-13 | Paper |
| Efficient randomized routing algorithms on the two-dimensional mesh of buses | 2001-08-20 | Paper |
| Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication. | 2001-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526992 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525681 | 2001-01-24 | Paper |
| Latent semantic indexing: A probabilistic analysis | 2000-12-19 | Paper |
| Multicolor routing in the undirected hypercube | 2000-11-22 | Paper |
| Greedily Finding a Dense Subgraph | 2000-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250212 | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234081 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252328 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228465 | 1999-05-18 | Paper |
| Efficient self-embedding of butterfly networks with random faults | 1999-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218425 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370205 | 1998-09-07 | Paper |
| Efficient Self-Embedding of Butterfly Networks with Random Faults | 1998-05-10 | Paper |
| How to cut pseudoparabolas into segments | 1998-03-11 | Paper |
| Routing a permutation in the hypercube by two sets of edge disjoint paths | 1997-12-17 | Paper |
| Construction of the mesh and the torus tolerating a large number of faults | 1997-03-18 | Paper |
| Routings for involutions of a hypercube | 1994-06-09 | Paper |
| First order compiler: A deterministic logic program synthesis algorithm | 1989-01-01 | Paper |
| Existential continuation | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830520 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746920 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691053 | 1983-01-01 | Paper |
