| Publication | Date of Publication | Type |
|---|
| Computing paths of large rank in planar frameworks deterministically | 2025-01-22 | Paper |
| Polynomial-time approximation of independent set parameterized by treewidth | 2025-01-06 | Paper |
| Kernelization for spreading points | 2025-01-06 | Paper |
| Lossy kernelization for (implicit) hitting set problems | 2025-01-06 | Paper |
| FPT approximation and subexponential algorithms for covering few or many edges | 2024-12-03 | Paper |
| Tree containment above minimum degree is FPT | 2024-11-28 | Paper |
| (Re)packing equal disks into rectangle | 2024-11-22 | Paper |
| Compound logics for modification problems | 2024-11-14 | Paper |
| Approximating long cycle above Dirac's guarantee | 2024-11-14 | Paper |
| Longest cycle above Erdős-Gallai bound | 2024-11-05 | Paper |
| Coresets for clustering in geometric intersection graphs | 2024-10-16 | Paper |
| Parameterized and approximation algorithms for the maximum bimodal subgraph problem | 2024-10-14 | Paper |
| Fast FPT-approximation of branchwidth | 2024-08-27 | Paper |
| Approximating long cycle above Dirac's guarantee | 2024-08-13 | Paper |
| Long cycles in graphs: extremal combinatorics meets parameterized algorithms (invited talk) | 2024-08-06 | Paper |
| Algorithmic extensions of Dirac's theorem | 2024-07-19 | Paper |
| (Re)packing equal disks into rectangle | 2024-06-24 | Paper |
| Diverse pairs of matchings | 2024-05-30 | Paper |
| Shortest cycles with monotone submodular costs | 2024-05-14 | Paper |
| Fixed-parameter tractability of maximum colored path and beyond | 2024-05-14 | Paper |
| Proportionally Fair Matching with Multiple Groups | 2024-05-03 | Paper |
| Parameterized Complexity of Broadcasting in Graphs | 2024-05-03 | Paper |
| Turán’s Theorem Through Algorithmic Lens | 2024-05-03 | Paper |
| Detours in directed graphs | 2024-04-23 | Paper |
| Parameterized complexity of broadcasting in graphs | 2024-04-16 | Paper |
| FPT approximation and subexponential algorithms for covering few or many edges | 2024-03-13 | Paper |
| On coresets for fair clustering in metric and Euclidean spaces and their applications | 2024-03-11 | Paper |
| Diverse collections in matroids and graphs | 2024-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6146249 | 2024-02-05 | Paper |
| Socially fair matching: exact and approximation algorithms | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147415 | 2024-01-15 | Paper |
| Fast FPT-approximation of branchwidth | 2023-12-08 | Paper |
| Diverse Pairs of Matchings | 2023-11-14 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | Paper |
| ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059156 | 2023-11-02 | Paper |
| Low-Rank Binary Matrix Approximation in Column-Sum Norm. | 2023-10-31 | Paper |
| How to find a good explanation for clustering? | 2023-08-28 | Paper |
| Lossy kernelization of same-size clustering | 2023-08-17 | Paper |
| Parameterized Complexity of Feature Selection for Categorical Data Clustering. | 2023-08-08 | Paper |
| Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs | 2023-07-17 | Paper |
| Detours in directed graphs | 2023-07-10 | Paper |
| A survey of parameterized algorithms and the complexity of edge modification | 2023-06-20 | Paper |
| Parameterized complexity of categorical clustering with size constraints | 2023-06-12 | Paper |
| Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | 2023-04-04 | Paper |
| On the optimality of pseudo-polynomial algorithms for integer programming | 2023-03-01 | Paper |
| Kernelization of Whitney Switches | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874521 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874519 | 2023-02-07 | Paper |
| On the Complexity of Recovering Incidence Matrices | 2023-02-07 | Paper |
| Parameterized k-Clustering: Tractability Island | 2023-02-03 | Paper |
| Parameterization Above a Multiplicative Guarantee | 2023-02-03 | Paper |
| Building large \(k\)-cores from sparse graphs | 2023-01-09 | Paper |
| Knot diagrams of treewidth two | 2022-12-21 | Paper |
| Lossy kernelization of same-size clustering | 2022-11-11 | Paper |
| On the Parameterized Complexity of the Expected Coverage Problem | 2022-10-19 | Paper |
| Present-biased optimization | 2022-10-04 | Paper |
| Multiplicative Parameterization Above a Guarantee | 2022-09-24 | Paper |
| Parameterized complexity of directed spanner problems | 2022-08-03 | Paper |
| Path Contraction Faster Than 2^n | 2022-07-21 | Paper |
| Decomposition of Map Graphs with Applications. | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091216 | 2022-07-21 | Paper |
| On the Parameterized Complexity of [1,j]-Domination Problems | 2022-07-21 | Paper |
| Computing Tree Decompositions with Small Independence Number | 2022-07-20 | Paper |
| Modification to Planarity is Fixed Parameter Tractable | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089202 | 2022-07-18 | Paper |
| Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs | 2022-06-08 | Paper |
| ETH-tight algorithms for long path and cycle on unit disk graphs | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075790 | 2022-05-11 | Paper |
| On the parameterized complexity of the expected coverage problem | 2022-05-09 | Paper |
| Parameterized complexity of elimination distance to first-order logic properties | 2022-04-29 | Paper |
| Parameterized complexity of categorical clustering with size constraints | 2022-03-25 | Paper |
| Computation of Hadwiger number and related contraction problems. Tight lower bounds | 2022-03-22 | Paper |
| Longest Cycle above Erd\H{o}s-Gallai Bound | 2022-02-07 | Paper |
| Parameterized Algorithms | 2022-02-04 | Paper |
| Compound Logics for Modification Problems | 2021-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009589 | 2021-08-04 | Paper |
| On the optimality of pseudo-polynomial algorithms for integer programming | 2021-08-04 | Paper |
| Parameterized low-rank binary matrix approximation | 2021-07-28 | Paper |
| Subexponential parameterized algorithms and kernelization on almost chordal graphs | 2021-06-30 | Paper |
| Kernelization of Whitney switches | 2021-06-28 | Paper |
| Subexponential algorithms for rectilinear Steiner tree and arborescence problems | 2021-05-03 | Paper |
| Kernelization of graph Hamiltonicity: proper \(H\)-graphs | 2021-04-28 | Paper |
| Parameterized \(k\)-clustering: tractability island | 2021-02-02 | Paper |
| Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs | 2021-02-02 | Paper |
| Hitting topological minors is FPT | 2021-01-19 | Paper |
| Parameterized low-rank binary matrix approximation | 2021-01-15 | Paper |
| Bidimensionality and kernels | 2021-01-13 | Paper |
| Going far from degeneracy | 2020-10-29 | Paper |
| On the tractability of optimization problems on \(H\)-graphs | 2020-09-03 | Paper |
| Partial complementation of graphs | 2020-08-25 | Paper |
| Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces | 2020-08-18 | Paper |
| Path contraction faster than \(2^n\) | 2020-07-30 | Paper |
| Covering vectors by spaces: regular matroids | 2020-05-27 | Paper |
| Finding detours is fixed-parameter tractable | 2020-05-27 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2020-05-27 | Paper |
| A fixed-parameter perspective on \#BIS | 2020-05-27 | Paper |
| Structured connectivity augmentation | 2020-05-26 | Paper |
| Subgraph complementation | 2020-05-21 | Paper |
| On the parameterized complexity of graph modification to first-order logic properties | 2020-02-27 | Paper |
| Kernelization of graph Hamiltonicity: proper \(H\)-graphs | 2020-01-16 | Paper |
| On the parameterized complexity of \([1,j]\)-domination problems | 2019-12-27 | Paper |
| Spanning circuits in regular matroids | 2019-12-02 | Paper |
| Approximation Schemes for Low-rank Binary Matrix Approximation Problems | 2019-12-02 | Paper |
| Finding detours is fixed-parameter tractable | 2019-11-27 | Paper |
| Exact algorithms via monotone local search | 2019-11-21 | Paper |
| Finding, hitting and packing cycles in subexponential time on unit disk graphs | 2019-11-07 | Paper |
| A fixed-parameter perspective on \#BIS | 2019-09-10 | Paper |
| Editing to Connected F-Degree Graph | 2019-08-29 | Paper |
| On width measures and topological problems on semi-complete digraphs | 2019-07-17 | Paper |
| Efficient computation of representative sets with applications in parameterized and exact algorithms | 2019-06-20 | Paper |
| Large induced subgraphs via triangulations and CMSO | 2019-06-20 | Paper |
| Jungles, bundles, and fixed-parameter tractability | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743514 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743499 | 2019-05-10 | Paper |
| Linear kernels for (connected) dominating set on \(H\)-minor-free graphs | 2019-05-10 | Paper |
| Clique-width: on the price of generality | 2019-05-06 | Paper |
| Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems | 2019-03-28 | Paper |
| Clique-width. III: Hamiltonian cycle and the odd case of graph coloring | 2019-03-28 | Paper |
| Parameterized single-exponential time polynomial space algorithm for Steiner tree | 2019-02-06 | Paper |
| Kernelization. Theory of parameterized preprocessing | 2019-01-14 | Paper |
| Covering Vectors by Spaces: Regular Matroids | 2018-11-19 | Paper |
| Structured connectivity augmentation | 2018-11-19 | Paper |
| Exact algorithms for terrain guarding | 2018-11-13 | Paper |
| Subexponential parameterized algorithm for {\textsc{Interval Completion}} | 2018-11-13 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-11-13 | Paper |
| Kernels for (connected) dominating set on graphs with excluded topological minors | 2018-11-12 | Paper |
| Combinatorial bounds via measure and conquer | 2018-11-05 | Paper |
| Representative families of product families | 2018-11-05 | Paper |
| Long directed \((s,t)\)-path: FPT algorithm | 2018-10-19 | Paper |
| Exact algorithms for terrain guarding | 2018-08-13 | Paper |
| (Meta) kernelization | 2018-08-02 | Paper |
| Efficient computation of representative families with applications in parameterized and exact algorithms | 2018-08-02 | Paper |
| Spanning circuits in regular matroids | 2018-07-16 | Paper |
| Fully polynomial-time parameterized computations for graphs and matrices of low treewidth | 2018-07-16 | Paper |
| Tight Bounds for Graph Homomorphism and Subgraph Isomorphism | 2018-07-16 | Paper |
| Subexponential parameterized algorithm for interval completion | 2018-07-16 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2018-05-23 | Paper |
| Tight lower bounds on graph embedding problems | 2018-05-17 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-05-02 | Paper |
| Matrix Rigidity from the Viewpoint of Parameterized Complexity | 2018-04-19 | Paper |
| Subexponential algorithms for rectilinear Steiner tree and arborescence problems | 2018-01-30 | Paper |
| Editing to connected \(f\)-degree graph | 2018-01-24 | Paper |
| Parameterized complexity of superstring problems | 2017-11-09 | Paper |
| Parameterized complexity of secluded connectivity problems | 2017-10-12 | Paper |
| Solving d-SAT via Backdoors to Small Treewidth | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365078 | 2017-09-29 | Paper |
| Exact algorithms via monotone local search | 2017-09-29 | Paper |
| On the tractability of optimization problems on H-graphs | 2017-09-27 | Paper |
| Parameterized complexity of secluded connectivity problems | 2017-07-13 | Paper |
| Faster exact algorithms for some terminal set problems | 2017-06-30 | Paper |
| Metric Dimension of Bounded Tree-length Graphs | 2017-06-14 | Paper |
| Connecting Vertices by Independent Trees | 2017-04-25 | Paper |
| Exploring subexponential parameterized complexity of completion problems | 2017-03-03 | Paper |
| Parameterized complexity of the anchored \(k\)-core problem for directed graphs | 2017-02-21 | Paper |
| Searching for better fill-in | 2017-01-30 | Paper |
| Tight bounds for parameterized complexity of Cluster Editing | 2017-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957874 | 2017-01-30 | Paper |
| Large Induced Subgraphs via Triangulations and CMSO | 2017-01-13 | Paper |
| Vertex cover structural parameterization revisited | 2016-12-22 | Paper |
| Exploring the subexponential complexity of completion problems | 2016-10-24 | Paper |
| Largest chordal and interval subgraphs faster than \(2^n\) | 2016-10-21 | Paper |
| A \(c^k n\) 5-approximation algorithm for treewidth | 2016-04-11 | Paper |
| Parameterized complexity of the anchored \(k\)-core problem for directed graphs | 2016-03-10 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2016-03-04 | Paper |
| The firefighter problem on graph classes | 2015-12-28 | Paper |
| How to hunt an invisible rabbit on a graph | 2015-12-11 | Paper |
| Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs | 2015-12-04 | Paper |
| A measure \& conquer approach for the analysis of exact algorithms | 2015-11-11 | Paper |
| A Subexponential Parameterized Algorithm for Proper Interval Completion | 2015-10-30 | Paper |
| Parameterized single-exponential time polynomial space algorithm for Steiner tree | 2015-10-27 | Paper |
| Lower bounds for the graph homomorphism problem | 2015-10-27 | Paper |
| Distortion is fixed parameter tractable | 2015-09-24 | Paper |
| Metric dimension of bounded width graphs | 2015-09-16 | Paper |
| Minimizing Rosenthal potential in multicast games | 2015-09-04 | Paper |
| Computing tree-depth faster than \(2^n\) | 2015-09-03 | Paper |
| Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs | 2015-09-02 | Paper |
| Parameterized complexity of superstring problems | 2015-08-20 | Paper |
| Parameterized algorithms | 2015-08-17 | Paper |
| Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs | 2015-08-03 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2015-03-02 | Paper |
| Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width | 2015-02-09 | Paper |
| On the parameterized complexity of vertex cover and edge cover with connectivity constraints | 2014-12-22 | Paper |
| On exact algorithms for treewidth | 2014-12-05 | Paper |
| Enumerating minimal subset feedback vertex sets | 2014-11-19 | Paper |
| A subexponential parameterized algorithm for proper interval completion | 2014-10-08 | Paper |
| Representative sets of product families | 2014-10-08 | Paper |
| Subexponential parameterized algorithms | 2014-10-07 | Paper |
| Long circuits and large Euler subgraphs | 2014-09-26 | Paper |
| Kernel(s) for problems with no kernel | 2014-09-09 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2014-09-02 | Paper |
| (Meta) Kernelization | 2014-07-25 | Paper |
| Parameterized algorithms to preserve connectivity | 2014-07-01 | Paper |
| Searching for better fill-in | 2014-06-10 | Paper |
| Tight bounds for parameterized complexity of cluster editing with a small number of clusters | 2014-06-10 | Paper |
| Parameterized complexity of firefighting | 2014-06-10 | Paper |
| Bidimensionality and kernels | 2014-05-22 | Paper |
| Algorithmic lower bounds for problems parameterized by clique-width | 2014-05-22 | Paper |
| Subexponential parameterized algorithm for minimum fill-in | 2014-04-11 | Paper |
| A Polynomial Kernel for Proper Interval Vertex Deletion | 2014-04-10 | Paper |
| To satisfy impatient web surfers is hard | 2014-03-13 | Paper |
| Parameterized complexity of connected even/odd subgraph problems | 2014-01-28 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2014-01-10 | Paper |
| Preprocessing subgraph and minor problems: when does a small vertex cover help? | 2013-12-13 | Paper |
| Computing Tree-Depth Faster Than 2 n | 2013-12-10 | Paper |
| Faster exact algorithms for some terminal set problems | 2013-12-10 | Paper |
| Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles | 2013-11-15 | Paper |
| On the Parameterized Complexity of Cutting a Few Vertices from a Graph | 2013-09-20 | Paper |
| Largest Chordal and Interval Subgraphs Faster Than 2 n | 2013-09-17 | Paper |
| Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph | 2013-09-17 | Paper |
| Long circuits and large Euler subgraphs | 2013-09-17 | Paper |
| Treewidth computation and extremal combinatorics | 2013-08-06 | Paper |
| Computing optimal Steiner trees in polynomial space | 2013-08-05 | Paper |
| Spanners of bounded degree graphs | 2013-04-04 | Paper |
| Subexponential algorithms for partial cover problems | 2013-04-04 | Paper |
| Exact algorithms for finding longest cycles in claw-free graphs | 2013-03-05 | Paper |
| A linear vertex kernel for maximum internal spanning tree | 2013-02-21 | Paper |
| Three complexity results on coloring \(P_k\)-free graphs | 2013-01-24 | Paper |
| Preprocessing subgraph and minor problems: When does a small vertex cover help? | 2013-01-07 | Paper |
| A note on exact algorithms for vertex ordering problems on graphs | 2012-12-06 | Paper |
| Cops and robber game without recharging | 2012-12-06 | Paper |
| Connected graph searching | 2012-11-27 | Paper |
| Parameterized complexity of the spanning tree congestion problem | 2012-11-21 | Paper |
| Fast minor testing in planar graphs | 2012-11-21 | Paper |
| Minimizing Rosenthal potential in multicast games | 2012-11-01 | Paper |
| Kernels for feedback arc set in tournaments | 2012-10-24 | Paper |
| Subexponential algorithms for partial cover problems | 2012-10-24 | Paper |
| Implicit branching and parameterized partial cover problems (extended abstract) | 2012-10-19 | Paper |
| A polynomial kernel for \textsc{Proper Interval Vertex Deletion} | 2012-09-25 | Paper |
| Cops and robber with constraints | 2012-09-12 | Paper |
| Counting subgraphs via homomorphisms | 2012-09-12 | Paper |
| FPT Suspects and Tough Customers: Open Problems of Downey and Fellows | 2012-09-05 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2012-08-31 | Paper |
| Parameterized complexity of connected even/odd subgraph problems | 2012-08-23 | Paper |
| Faster algorithms for finding and counting subgraphs | 2012-08-17 | Paper |
| Catalan structures and dynamic programming in \(H\)-minor-free graphs | 2012-08-17 | Paper |
| Local search: is brute-force avoidable? | 2012-08-17 | Paper |
| \(k\)-gap interval graphs | 2012-06-29 | Paper |
| Parameterized Complexity of Firefighting Revisited | 2012-06-15 | Paper |
| More about subcolorings | 2012-06-04 | Paper |
| Sharp separation and applications to exact and parameterized algorithms | 2012-04-26 | Paper |
| Approximating acyclicity parameters of sparse hypergraphs | 2012-04-24 | Paper |
| \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves | 2012-04-24 | Paper |
| Parameterized algorithm for eternal vertex cover | 2012-03-19 | Paper |
| Approximating width parameters of hypergraphs with excluded minors | 2012-03-15 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2012-01-23 | Paper |
| Finding induced subgraphs via minimal triangulations | 2012-01-23 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2012-01-23 | Paper |
| Implicit branching and parameterized partial cover problems | 2012-01-11 | Paper |
| Kernels for feedback arc set in tournaments | 2012-01-11 | Paper |
| Spanners in sparse graphs | 2012-01-11 | Paper |
| How to guard a graph? | 2011-12-14 | Paper |
| Faster parameterized algorithms for minor containment | 2011-12-07 | Paper |
| Guard games on graphs: keep the intruder out! | 2011-12-07 | Paper |
| On the complexity of reconstructing H-free graphs from their Star Systems | 2011-10-12 | Paper |
| Branch and recharge: exact algorithms for generalized domination | 2011-09-20 | Paper |
| Exact algorithm for the maximum induced planar subgraph problem | 2011-09-16 | Paper |
| Enumerating minimal subset feedback vertex sets | 2011-08-12 | Paper |
| Contraction obstructions for treewidth | 2011-08-10 | Paper |
| An exact algorithm for minimum distortion embedding | 2011-07-14 | Paper |
| Ranking and drawing in subexponential time | 2011-05-19 | Paper |
| Strengthening Erdős -- Pósa property for minor-closed graph classes | 2011-03-21 | Paper |
| On the complexity of some colorful problems parameterized by treewidth | 2011-02-21 | Paper |
| Approximation of minimum weight spanners for sparse graphs | 2011-02-21 | Paper |
| Approximation algorithms for domination search | 2011-02-15 | Paper |
| Mixed search number and linear-width of interval and split graphs | 2010-11-24 | Paper |
| Exact exponential algorithms. | 2010-11-18 | Paper |
| Intractability of clique-width parameterizations | 2010-11-04 | Paper |
| Rank-width and tree-width of \(H\)-minor-free graphs | 2010-10-18 | Paper |
| Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions | 2010-09-27 | Paper |
| Fast minor testing in planar graphs | 2010-09-06 | Paper |
| Sort and Search: exact algorithms for generalized domination | 2010-08-20 | Paper |
| Measure and conquer | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579494 | 2010-08-06 | Paper |
| The curse of connectivity: \(t\)-total vertex (edge) cover | 2010-07-20 | Paper |
| Faster parameterized algorithms for minor containment | 2010-06-22 | Paper |
| Cops and Robber game without recharging | 2010-06-22 | Paper |
| Guard games on graphs: keep the intruder out! | 2010-05-11 | Paper |
| Computing branchwidth via efficient triangulations and blocks | 2010-04-28 | Paper |
| Sharp separation and applications to exact and parameterized algorithms | 2010-04-27 | Paper |
| Graph searching, elimination trees, and a generalization of bandwidth. | 2010-04-20 | Paper |
| Spanning directed trees with many leaves | 2010-03-17 | Paper |
| Iterative compression and exact algorithms | 2010-03-09 | Paper |
| Pursuing a fast robber on a graph | 2010-03-09 | Paper |
| Dominating sets and local treewidth | 2010-03-03 | Paper |
| Fast exact algorithms for Hamiltonicity in claw-free graphs | 2010-01-21 | Paper |
| An exact algorithm for minimum distortion embedding | 2010-01-21 | Paper |
| Backbone colorings for networks. | 2010-01-12 | Paper |
| Pathwidth of cubic graphs and exact algorithms | 2009-12-18 | Paper |
| A linear vertex kernel for Maximum Internal Spanning Tree | 2009-12-17 | Paper |
| Three complexity results on coloring \(P _{k }\)-free graphs | 2009-12-11 | Paper |
| Contraction Bidimensionality: The Accurate Picture | 2009-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396567 | 2009-09-19 | Paper |
| Counting Subgraphs via Homomorphisms | 2009-07-14 | Paper |
| Distortion Is Fixed Parameter Tractable | 2009-07-14 | Paper |
| On two techniques of combining branching and treewidth | 2009-06-22 | Paper |
| Exact Algorithms for Treewidth and Minimum Fill-In | 2009-06-22 | Paper |
| Nondeterministic graph searching: from pathwidth to treewidth | 2009-06-17 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Counting Minimum Weighted Dominating Sets | 2009-03-06 | Paper |
| Improved Exact Algorithms for Counting 3- and 4-Colorings | 2009-03-06 | Paper |
| On the Complexity of Some Colorful Problems Parameterized by Treewidth | 2009-03-03 | Paper |
| Branch and Recharge: Exact Algorithms for Generalized Domination | 2009-02-17 | Paper |
| Improved Algorithms for the Feedback Vertex Set Problems | 2009-02-17 | Paper |
| Iterative Compression and Exact Algorithms | 2009-02-03 | Paper |
| A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs | 2009-02-03 | Paper |
| How to Guard a Graph? | 2009-01-29 | Paper |
| On the minimum feedback vertex set problem: Exact and enumeration algorithms | 2008-12-02 | Paper |
| Solving connected dominating set faster than \(2^n\) | 2008-12-02 | Paper |
| Faster Steiner Tree Computation in Polynomial-Space | 2008-11-25 | Paper |
| Improved algorithms for feedback vertex set problems | 2008-11-19 | Paper |
| Treewidth Computation and Extremal Combinatorics | 2008-08-28 | Paper |
| Spanners in Sparse Graphs | 2008-08-28 | Paper |
| Mixed Search Number and Linear-Width of Interval and Split Graphs | 2008-07-01 | Paper |
| An annotated bibliography on guaranteed graph searching | 2008-06-24 | Paper |
| Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$ | 2008-06-03 | Paper |
| Branching and Treewidth Based Exact Algorithms | 2008-04-24 | Paper |
| Better Algorithms and Bounds for Directed Maximum Leaf Problems | 2008-04-24 | Paper |
| Solving Connected Dominating Set Faster Than 2 n | 2008-04-17 | Paper |
| On the Complexity of Reconstructing H-free Graphs from Their Star Systems | 2008-04-15 | Paper |
| On Exact Algorithms for Treewidth | 2008-03-11 | Paper |
| Subexponential Parameterized Algorithms | 2007-11-28 | Paper |
| Parameterized Algorithms for Directed Maximum Leaf Problems | 2007-11-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus | 2007-09-07 | Paper |
| Exact algorithms for graph homomorphisms | 2007-09-06 | Paper |
| Optimal Linear Arrangement of Interval Graphs | 2007-09-05 | Paper |
| Search in graphs | 2007-08-21 | Paper |
| Backbone colorings for graphs: Tree and path backbones | 2007-06-11 | Paper |
| On self duality of pathwidth in polyhedral graph embeddings | 2007-06-11 | Paper |
| A 3-approximation for the pathwidth of Halin graphs | 2007-05-29 | Paper |
| On maximum number of minimal dominating sets in graphs | 2007-05-29 | Paper |
| Connected Graph Searching in Outerplanar Graphs | 2007-05-29 | Paper |
| Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up | 2007-05-03 | Paper |
| Eliminating graphs by means of parallel knock-out schemes | 2007-02-19 | Paper |
| A 3-approximation for the pathwidth of Halin graphs | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult | 2006-08-16 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| New upper bounds on the decomposability of planar graphs | 2006-03-24 | Paper |
| Equitable colorings of bounded treewidth graphs | 2006-03-20 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Bidimensional Parameters and Local Treewidth | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Radio Labeling with Preassigned Frequencies | 2005-02-23 | Paper |
| Tree decompositions with small cost | 2005-02-22 | Paper |
| Graph searching, elimination trees, and a generalization of bandwidth | 2005-02-21 | Paper |
| On distance constrained labeling of disk graphs | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046488 | 2004-08-12 | Paper |
| Tree Decompositions with Small Cost | 2004-08-12 | Paper |
| AT-free graphs: Linear bounds for the oriented diameter | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471291 | 2004-07-28 | Paper |
| Complexity of approximating the oriented diameter of chordal graphs | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448756 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448757 | 2004-02-18 | Paper |
| On a complementary interval graph with the lowest max-degree | 2004-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449223 | 2004-02-08 | Paper |
| Discrete search programs on graphs | 2004-01-29 | Paper |
| Algorithms for graphs with small octopus | 2004-01-26 | Paper |
| On the monotonicity of games generated by symmetric submodular functions. | 2003-10-14 | Paper |
| Interval degree and bandwidth of a graph | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414486 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414499 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411360 | 2003-07-08 | Paper |
| Pathwidth of planar and line graphs | 2003-07-08 | Paper |
| On the domination search number | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796709 | 2003-04-03 | Paper |
| Approximation algorithms for time-dependent orienteering. | 2003-01-21 | Paper |
| Approximating minimum cocolorings. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782745 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782702 | 2002-12-02 | Paper |
| Approximation of pathwidth of outerplanar graphs | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766679 | 2002-07-14 | Paper |
| The search and the node-search number of dual graphs | 2002-04-08 | Paper |
| Bilateral orientations and domination | 2001-10-24 | Paper |
| The total vertex separation number and profile of a graph | 2001-08-02 | Paper |
| Graph searching and interval completion | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387119 | 1999-10-31 | Paper |
| Note on a helicopter search problem on graphs | 1999-09-22 | Paper |
| Searching expenditure and interval graphs | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232802 | 1999-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387698 | 1998-10-19 | Paper |
| Helicopter search problems, bandwidth and pathwidth | 1998-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4396114 | 1998-06-11 | Paper |
| The search for the evader on 3-minimal trees | 1997-11-20 | Paper |
| A search problem on a graph under restriction of the velocity | 1997-02-03 | Paper |
