| Publication | Date of Publication | Type |
|---|
| Evaluating restricted first-order counting properties on nowhere dense classes and beyond | 2025-01-06 | Paper |
| The online simple knapsack problem with reservation and removability | 2024-12-03 | Paper |
| Transformations of probability distributions | 2024-10-08 | Paper |
| Delaying decisions and reservation costs | 2024-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192480 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147359 | 2024-01-15 | Paper |
| Online knapsack with removal and recourse | 2023-12-22 | Paper |
| Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size | 2023-10-31 | Paper |
| On the Advice Complexity of Online Edge- and Node-Deletion Problems | 2023-06-30 | Paper |
| The secretary problem with reservation costs | 2023-03-30 | Paper |
| An open pouring problem | 2023-02-07 | Paper |
| First-Order Model-Checking in Random Graphs and Complex Networks | 2023-02-07 | Paper |
| The complexity of packing edge-disjoint paths | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875543 | 2023-02-03 | Paper |
| Motif Counting in Preferential Attachment Graphs | 2023-02-03 | Paper |
| PRAM's towards realistic parallelism: BRAM's | 2022-12-09 | Paper |
| Further Results on Online Node- and Edge-Deletion Problems with Advice | 2022-10-13 | Paper |
| Reoptimization of parameterized problems | 2022-08-30 | Paper |
| Parallel recognition and ranking of context-free languages | 2022-08-18 | Paper |
| The emptiness problem for intersections of regular languages | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089196 | 2022-07-18 | Paper |
| Online node- and edge-deletion problems with advice | 2021-09-02 | Paper |
| An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem | 2020-11-25 | Paper |
| Local Structure Theorems for Erdős–Rényi Graphs and Their Algorithmic Applications | 2020-10-21 | Paper |
| Width, depth, and space: tradeoffs between branching and dynamic programming | 2020-01-21 | Paper |
| What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) | 2019-11-29 | Paper |
| Evaluation of an MSO-Solver | 2019-09-12 | Paper |
| Structural sparsity of complex networks: bounded expansion in random models and real-world graphs | 2019-08-07 | Paper |
| Moderately exponential time algorithms for the maximum bounded-degree-1 set problem | 2018-12-03 | Paper |
| Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions | 2018-10-30 | Paper |
| Fixed-parameter algorithms for Vertex Cover \(P_3\) | 2018-05-24 | Paper |
| Optimal average case sorting on arrays | 2017-12-04 | Paper |
| What one has to know when attacking \(\mathsf {P}\) vs. \(\mathsf {NP}\) (extended abstract) | 2017-11-22 | Paper |
| Kernelization using structural parameters on sparse graph classes | 2016-11-14 | Paper |
| Are there any good digraph width measures? | 2015-12-11 | Paper |
| Finite Integer Index of Pathwidth and Treewidth | 2015-09-15 | Paper |
| Practical algorithms for MSO model-checking on tree-decomposable graphs | 2014-11-24 | Paper |
| A Faster Parameterized Algorithm for Treedepth | 2014-07-01 | Paper |
| Exact algorithms for problems related to the densest \(k\)-set problem | 2014-05-05 | Paper |
| Testing consistency of quartet topologies: a parameterized approach | 2014-04-14 | Paper |
| Digraph width measures in parameterized algorithmics | 2014-04-02 | Paper |
| The online knapsack problem: advice and randomization | 2014-03-13 | Paper |
| Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking | 2014-01-28 | Paper |
| Fast exact algorithm for \(L(2,1)\)-labeling of graphs | 2014-01-16 | Paper |
| Kernelization Using Structural Parameters on Sparse Graph Classes | 2013-09-17 | Paper |
| Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions | 2013-08-06 | Paper |
| Recognition of probe distance-hereditary graphs | 2013-01-18 | Paper |
| On the Power of Randomness versus Advice in Online Computation | 2012-11-01 | Paper |
| A Fine-grained Analysis of a Simple Independent Set Algorithm | 2012-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904773 | 2012-08-23 | Paper |
| On the Advice Complexity of the Knapsack Problem | 2012-06-29 | Paper |
| Courcelle's theorem -- a game-theoretic approach | 2012-04-05 | Paper |
| An exact algorithm for the maximum leaf spanning tree problem | 2012-01-09 | Paper |
| A new algorithm for finding trees with many leaves | 2011-12-14 | Paper |
| A property tester for tree-likeness of quartet topologies | 2011-11-30 | Paper |
| Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack | 2011-08-23 | Paper |
| Fast Exact Algorithm for L(2,1)-Labeling of Graphs | 2011-07-01 | Paper |
| Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory | 2011-07-01 | Paper |
| Are There Any Good Digraph Width Measures? | 2010-12-07 | Paper |
| New fixed-parameter algorithms for the minimum quartet inconsistency problem | 2010-10-06 | Paper |
| A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance | 2010-05-28 | Paper |
| A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms | 2010-03-17 | Paper |
| Parameterized power domination complexity | 2010-01-18 | Paper |
| An Exact Algorithm for the Maximum Leaf Spanning Tree Problem | 2010-01-14 | Paper |
| On Digraph Width Measures in Parameterized Algorithmics | 2010-01-14 | Paper |
| Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms | 2010-01-06 | Paper |
| Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution | 2009-10-29 | Paper |
| Reoptimization of Steiner trees: changing the terminal set | 2009-08-21 | Paper |
| Breaking Anonymity by Learning a Unique Minimum Hitting Set | 2009-08-18 | Paper |
| A New Algorithm for Finding Trees with Many Leaves | 2009-01-29 | Paper |
| Improved Upper Bounds for Partial Vertex Cover | 2009-01-20 | Paper |
| Divide-and-Color | 2008-09-04 | Paper |
| An efficient automata approach to some problems on context-free grammars. | 2008-06-27 | Paper |
| Enumerate and expand: Improved algorithms for connected vertex cover and tree cover | 2008-06-17 | Paper |
| New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem | 2008-06-05 | Paper |
| Intuitive Algorithms and t-Vertex Cover | 2008-04-24 | Paper |
| A Faster Algorithm for the Steiner Tree Problem | 2008-03-19 | Paper |
| Partial vs. Complete Domination: t-Dominating Set | 2008-03-07 | Paper |
| Dynamic programming for minimum Steiner trees | 2007-12-19 | Paper |
| Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants | 2007-09-10 | Paper |
| Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover | 2007-05-02 | Paper |
| An efficient fixed-parameter algorithm for 3-hitting set | 2007-04-26 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472490 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474112 | 2004-08-04 | Paper |
| Fixed-parameter algorithms for CLOSEST STRING and related problems | 2004-03-11 | Paper |
| Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. | 2003-09-15 | Paper |
| On efficient fixed-parameter algorithms for weighted vertex cover | 2003-08-17 | Paper |
| A general method to speed up fixed-parameter-tractable algorithms | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754086 | 2001-11-11 | Paper |
| Stochastic finite learning of the pattern languages | 2001-10-14 | Paper |
| Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729233 | 2001-07-18 | Paper |
| New Upper Bounds for Maximum Satisfiability | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938646 | 2000-10-17 | Paper |
| Optimal deterministic sorting and routing on grids and tori with diagonals | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955306 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942648 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703851 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266543 | 1999-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251072 | 1999-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4371017 | 1998-09-20 | Paper |
| Unambiguous computations and locally definable acceptance types | 1998-08-13 | Paper |
| Expressing uniformity via oracles | 1997-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4332157 | 1997-05-25 | Paper |
| Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits | 1995-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281549 | 1994-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035667 | 1993-05-18 | Paper |
| Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357533 | 1990-01-01 | Paper |
