| Publication | Date of Publication | Type |
|---|
| Efficient parallel algorithms for some tree layout problems | 2023-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875491 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091205 | 2022-07-21 | Paper |
| Dynamic random graphs with vertex removal | 2022-07-11 | Paper |
| A survey of the modified Moran process and evolutionary graph theory | 2021-12-20 | Paper |
| On list \(k\)-coloring convex bipartite graphs | 2021-12-08 | Paper |
| Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier | 2021-07-29 | Paper |
| Learning random points from geometric graphs or orderings | 2020-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5131261 | 2020-11-05 | Paper |
| Book review of: G. Ausiello, The making of a new science. A personal journey through the early years of theoretical computer science | 2020-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743450 | 2019-05-10 | Paper |
| On the fixation probability of superstars | 2017-09-29 | Paper |
| Minimum bisection is NP-hard on unit disk graphs | 2017-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968924 | 2017-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969651 | 2017-03-22 | Paper |
| On the relation between graph distance and Euclidean distance in random geometric graphs | 2016-11-01 | Paper |
| On the stability of generalized second price auctions with budgets | 2016-09-21 | Paper |
| Complexity of metric dimension on planar graphs | 2016-09-16 | Paper |
| Absorption time of the Moran process | 2016-09-07 | Paper |
| Approximating fixation probabilities in the generalized Moran process | 2014-11-19 | Paper |
| Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms. | 2014-10-24 | Paper |
| The cook-book approach to the differential equation method | 2014-10-24 | Paper |
| Book review of: C. Moore and S. Mertens, The nature of computation. | 2014-10-24 | Paper |
| Minimum Bisection Is NP-hard on Unit Disk Graphs | 2014-10-14 | Paper |
| On the stability of generalized second price auctions with budgets | 2014-03-31 | Paper |
| The Power of Choice for Random Satisfiability | 2013-10-04 | Paper |
| Continuous monitoring in the dynamic sensor field model | 2013-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165956 | 2012-10-19 | Paper |
| On the Complexity of Metric Dimension | 2012-09-25 | Paper |
| Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks | 2011-09-16 | Paper |
| Theoretical Aspects of Graph Models for MANETs | 2011-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579492 | 2010-08-06 | Paper |
| The distant-2 chromatic number of random proximity and random geometric graphs | 2010-04-19 | Paper |
| A note on the subgraphs of the (\(2\times \infty \))-grid | 2010-03-29 | Paper |
| On the chromatic number of a random 5-regular graph | 2009-12-18 | Paper |
| Paradigms for Fast Parallel Approximability | 2009-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395943 | 2009-09-15 | Paper |
| On the satisfiability threshold of formulas with three literals per clause | 2009-08-07 | Paper |
| On the probability of the existence of fixed-size components in random geometric graphs | 2009-07-22 | Paper |
| Balanced cut approximation in random geometric graphs | 2009-07-10 | Paper |
| Walkers on the Cycle and the Grid | 2009-05-27 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| High level communication functionalities for wireless sensor networks | 2008-11-12 | Paper |
| Efficient algorithms for counting parameterized list \(H\)-colorings | 2008-06-26 | Paper |
| Balanced Cut Approximation in Random Geometric Graphs | 2008-04-24 | Paper |
| Sharp Threshold for Hamiltonicity of Random Geometric Graphs | 2008-03-28 | Paper |
| Fast FPT-Algorithms for Cleaning Grids | 2008-03-19 | Paper |
| Bounds on the bisection width for random \(d\)-regular graphs | 2007-09-18 | Paper |
| Kernels for the Vertex Cover Problem on the Preferred Attachment Model | 2007-09-14 | Paper |
| Communication tree problems | 2007-09-03 | Paper |
| Complexity issues on bounded restrictive \(H\)-coloring | 2007-06-26 | Paper |
| MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs | 2007-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424889 | 2007-03-05 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| The chromatic and clique numbers of random scaled sector graphs | 2006-03-20 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668721 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668726 | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660720 | 2005-04-04 | Paper |
| The restrictive \(H\)-coloring problem | 2005-02-22 | Paper |
| Bounds on the max and min bisection of random cubic and random 4-regular graphs | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440432 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427278 | 2003-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426348 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414491 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779153 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551368 | 2002-09-05 | Paper |
| Counting \(H-\)colorings of partial \(k-\)trees | 2002-07-15 | Paper |
| Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs | 2001-10-07 | Paper |
| Approximating Layout Problems on Random Geometric Graphs | 2001-07-29 | Paper |
| The hardness of intervalizing four colored caterpillars | 2001-07-18 | Paper |
| Approximating layout problems on random graphs | 2001-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942035 | 2001-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520312 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788607 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944988 | 2000-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263466 | 1999-09-22 | Paper |
| Paradigms for Fast Parallel Approximability | 1999-02-28 | Paper |
| On the random generation and counting of matchings in dense graphs | 1998-08-13 | Paper |
| Parallel algorithms for the minimum cut and the minimum length tree layout problems | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336266 | 1997-06-12 | Paper |
| Parallel approximation schemes for problems on planar graphs | 1997-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321931 | 1995-02-06 | Paper |
| The query complexity of learning DFA | 1994-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4039803 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3996675 | 1992-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974851 | 1992-06-26 | Paper |
| Classes of bounded nondeterminism | 1990-01-01 | Paper |
| On characterizations of the class PSPACE/poly | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753480 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692867 | 1985-01-01 | Paper |
| Uniform characterizations of non-uniform complexity measures | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745282 | 1984-01-01 | Paper |
| A note on a theorem by Ladner | 1982-01-01 | Paper |
