| Publication | Date of Publication | Type |
|---|
| Dominator coloring and CD coloring in almost cluster graphs | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089665 | 2023-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089666 | 2023-11-13 | Paper |
| Deletion to scattered graph classes. I: Case of finite number of graph classes | 2023-08-21 | Paper |
| Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes | 2023-06-12 | Paper |
| Structural parameterizations of budgeted graph coloring | 2023-04-20 | Paper |
| Sublinear-space approximation algorithms for Max \(r\)-SAT | 2023-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875640 | 2023-02-03 | Paper |
| Improved kernels for tracking paths | 2023-02-03 | Paper |
| The complexity of finding certain trees in tournaments | 2023-01-18 | Paper |
| Recognizing \(k\)-clique extendible orderings | 2022-12-21 | Paper |
| Improved upper bounds for time-space tradeoffs for selection with limited storage | 2022-12-09 | Paper |
| Output sensitive fault tolerant maximum matching | 2022-11-11 | Paper |
| Finding kings in tournaments | 2022-10-13 | Paper |
| Structural parameterizations of Tracking Paths problem | 2022-10-06 | Paper |
| Tight bounds for finding degrees from the adjacency matrix | 2022-08-16 | Paper |
| Structural parameterizations with modulator oblivion | 2022-08-03 | Paper |
| Approximation in (Poly-) Logarithmic Space | 2022-07-18 | Paper |
| Structural parameterizations of budgeted graph coloring | 2022-07-13 | Paper |
| Faster FPT algorithms for deletion to pairs of graph classes | 2022-05-20 | Paper |
| Parameterizing role coloring on forests | 2022-03-24 | Paper |
| Recognizing \(k\)-clique extendible orderings | 2021-11-19 | Paper |
| Frameworks for designing in-place graph algorithms | 2021-10-28 | Paper |
| A Framework for In-place Graph Algorithms | 2021-08-04 | Paper |
| Parameterized complexity of conflict-free set cover | 2021-08-03 | Paper |
| Approximation in (Poly-) logarithmic space | 2021-06-30 | Paper |
| Fixed-parameter tractability of \((n-k)\) list coloring | 2021-06-11 | Paper |
| Fixed-parameter tractable algorithms for tracking shortest paths | 2020-11-06 | Paper |
| Elusiveness of finding degrees | 2020-09-17 | Paper |
| A characterization of König-Egerváry graphs with extendable vertex covers | 2020-08-04 | Paper |
| Recognizing $k$-Clique Extendible Orderings | 2020-07-12 | Paper |
| Some (in)tractable parameterizations of coloring and list-coloring | 2020-07-07 | Paper |
| Fully dynamic arboricity maintenance | 2020-05-23 | Paper |
| List-coloring -- parameterizing from triviality | 2020-04-22 | Paper |
| Fixed-parameter tractability of \((n-k)\) list coloring | 2020-02-25 | Paper |
| Solving group interval scheduling efficiently | 2020-02-25 | Paper |
| Fully dynamic arboricity maintenance | 2020-02-24 | Paper |
| Deconstructing parameterized hardness of Fair Vertex Deletion problems | 2020-02-24 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-02-12 | Paper |
| A polynomial sized kernel for tracking paths problem | 2020-01-16 | Paper |
| Parameterized complexity of geometric covering problems having conflicts | 2020-01-16 | Paper |
| Tractability of König edge deletion problems | 2019-11-13 | Paper |
| Parameterized complexity of conflict-free set cover | 2019-10-22 | Paper |
| Revisiting connected vertex cover: FPT algorithms and lossy kernels | 2019-09-05 | Paper |
| Polynomial kernels for vertex cover parameterized by small degree modulators | 2019-09-05 | Paper |
| Space efficient linear time algorithms for BFS, DFS and applications | 2019-09-05 | Paper |
| Selection and Sorting in the “Restore” Model | 2019-06-20 | Paper |
| Harmonious coloring: parameterized algorithms and upper bounds | 2019-05-17 | Paper |
| FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters | 2019-04-26 | Paper |
| The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments | 2019-04-26 | Paper |
| Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs | 2019-01-11 | Paper |
| Maintaining chordal graphs dynamically: improved upper and lower bounds | 2018-11-28 | Paper |
| Structural parameterizations of dominating set variants | 2018-11-28 | Paper |
| Selection and Sorting in the “Restore” Model | 2018-11-13 | Paper |
| Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets | 2018-11-05 | Paper |
| Faster Parameterized Algorithms Using Linear Programming | 2018-10-30 | Paper |
| Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization | 2018-07-26 | Paper |
| Fréchet distance between a line and avatar point set | 2018-07-26 | Paper |
| Approximability of clique transversal in perfect graphs | 2018-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636003 | 2018-04-23 | Paper |
| Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits | 2018-04-19 | Paper |
| Fréchet Distance Between a Line and Avatar Point Set | 2018-04-19 | Paper |
| Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs | 2018-03-21 | Paper |
| Finding modes with equality comparisons | 2017-11-16 | Paper |
| On the succinct representation of equivalence classes | 2017-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365078 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363786 | 2017-09-29 | Paper |
| Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas | 2017-09-27 | Paper |
| Parameterized complexity of geometric covering problems having conflicts | 2017-09-22 | Paper |
| Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits | 2017-09-15 | Paper |
| On the parameterized complexity of reconfiguration problems | 2017-05-11 | Paper |
| Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime | 2017-04-07 | Paper |
| Elusiveness of Finding Degrees | 2017-04-07 | Paper |
| Exact and Parameterized Algorithms for (k, i)-Coloring | 2017-04-07 | Paper |
| Path balance heuristic for self-adjusting binary search trees | 2017-01-19 | Paper |
| Harmonious Coloring: Parameterized Algorithms and Upper Bounds | 2016-12-22 | Paper |
| Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs | 2016-10-24 | Paper |
| Improved Space Efficient Algorithms for BFS, DFS and Applications | 2016-09-02 | Paper |
| Less space: indexing for queries with wildcards | 2016-06-27 | Paper |
| A simplified NP-complete MAXSAT problem | 2016-06-09 | Paper |
| An improved fixed-parameter algorithm for vertex cover | 2016-06-09 | Paper |
| Finding Mode Using Equality Comparisons | 2016-05-03 | Paper |
| Space efficient data structures for nearest larger neighbor | 2016-02-18 | Paper |
| Sorting and Selection with Equality Comparisons | 2015-10-30 | Paper |
| Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs | 2015-10-29 | Paper |
| Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas | 2015-10-27 | Paper |
| The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration | 2015-09-15 | Paper |
| Space Efficient Data Structures for Nearest Larger Neighbor | 2015-09-15 | Paper |
| Reconfiguration over Tree Decompositions | 2015-09-15 | Paper |
| Vertex Cover Reconfiguration and Beyond | 2015-09-11 | Paper |
| Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes | 2015-09-11 | Paper |
| Faster fixed parameter tractable algorithms for finding feedback vertex sets | 2015-09-02 | Paper |
| Succinct ordinal trees with level-ancestor queries | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501236 | 2015-08-03 | Paper |
| Finding median in read-only memory on integer input | 2015-04-29 | Paper |
| Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond | 2014-12-05 | Paper |
| The kernelization complexity of connected domination in graphs with (no) small cycles | 2014-12-02 | Paper |
| Improved Explicit Data Structures in the Bitprobe Model | 2014-10-08 | Paper |
| LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs | 2014-10-08 | Paper |
| Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization | 2014-01-16 | Paper |
| Solving min ones 2-SAT as fast as vertex cover | 2014-01-16 | Paper |
| Less Space: Indexing for Queries with Wildcards | 2014-01-14 | Paper |
| Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers | 2014-01-14 | Paper |
| Succinct Data Structures for Representing Equivalence Classes | 2014-01-14 | Paper |
| Parameterized complexity of MaxSat above average | 2014-01-13 | Paper |
| Beyond bidimensionality: parameterized subexponential algorithms on directed graphs | 2014-01-10 | Paper |
| On the parameterized complexity of reconfiguration problems | 2013-12-10 | Paper |
| Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs | 2013-12-06 | Paper |
| A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments | 2013-12-02 | Paper |
| An FPT algorithm for Tree Deletion Set | 2013-11-28 | Paper |
| A Survey of Data Structures in the Bitprobe Model | 2013-09-13 | Paper |
| Fixed-Parameter Tractability of Satisfying beyond the Number of Variables | 2013-08-12 | Paper |
| The parameterized complexity of unique coverage and its variants | 2013-08-05 | Paper |
| Upper and Lower Bounds for Weak Backdoor Set Detection | 2013-08-05 | Paper |
| Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem | 2013-04-12 | Paper |
| An FPT Algorithm for Tree Deletion Set | 2013-04-12 | Paper |
| Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds | 2013-04-09 | Paper |
| Subexponential algorithms for partial cover problems | 2013-04-04 | Paper |
| FPT algorithms for connected feedback vertex set | 2012-12-21 | Paper |
| On parameterized independent feedback vertex set | 2012-11-27 | Paper |
| Parameterized Algorithms for Even Cycle Transversal | 2012-11-06 | Paper |
| Subexponential algorithms for partial cover problems | 2012-10-24 | Paper |
| On the directed full degree spanning tree problem | 2012-10-16 | Paper |
| Lower bounds on kernelization | 2012-10-16 | Paper |
| Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows | 2012-09-05 | Paper |
| The effect of girth on the kernelization complexity of connected dominating set | 2012-08-29 | Paper |
| LP can be a cure for parameterized problems | 2012-08-23 | Paper |
| Faster algorithms for finding and counting subgraphs | 2012-08-17 | Paper |
| Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs | 2012-08-14 | Paper |
| Succinct representations of permutations and functions | 2012-08-08 | Paper |
| Parameterized complexity of MaxSat above average | 2012-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113754 | 2012-01-23 | Paper |
| A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments | 2011-12-16 | Paper |
| The complexity of König subgraph problems and above-guarantee vertex cover | 2011-12-14 | Paper |
| Paths, Flowers and Vertex Cover | 2011-09-16 | Paper |
| On Parameterized Independent Feedback Vertex Set | 2011-08-17 | Paper |
| A Quartic Kernel for Pathwidth-One Vertex Deletion | 2010-11-16 | Paper |
| Solving minones-2-sat as Fast as vertex cover | 2010-09-03 | Paper |
| Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing | 2010-06-22 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG | 2010-03-24 | Paper |
| Parameterized complexity of the induced subgraph problem in directed graphs | 2010-03-24 | Paper |
| FPT Algorithms for Connected Feedback Vertex Set | 2010-02-09 | Paper |
| On the Directed Degree-Preserving Spanning Tree Problem | 2010-01-14 | Paper |
| Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels | 2009-10-29 | Paper |
| The Budgeted Unique Coverage Problem and Color-Coding | 2009-08-18 | Paper |
| Parameterizing above or below guaranteed values | 2009-03-11 | Paper |
| König Deletion Sets and Vertex Covers above the Matching Size | 2009-01-29 | Paper |
| Parameterized Algorithms for Generalized Domination | 2009-01-27 | Paper |
| Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles | 2008-12-02 | Paper |
| Parameterizing MAX SNP Problems Above Guaranteed Values | 2008-06-03 | Paper |
| The Parameterized Complexity of the Unique Coverage Problem | 2008-05-27 | Paper |
| The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number | 2008-05-27 | Paper |
| Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems | 2008-04-17 | Paper |
| Efficient exact algorithms through enumerating maximal independent sets and other techniques | 2007-12-19 | Paper |
| Triangles, 4-Cycles and Parameterized (In-)Tractability | 2007-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439693 | 2007-05-29 | Paper |
| A simple optimal representation for balanced parentheses | 2007-01-22 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| APPROXIMATE BLOCK SORTING | 2006-05-10 | Paper |
| Parameterized algorithms for feedback set problems and their duals in tournaments | 2006-04-06 | Paper |
| Representing trees of higher degree | 2006-03-21 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024774 | 2005-07-04 | Paper |
| Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449187 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427867 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425958 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796182 | 2003-03-02 | Paper |
| Parameterized complexity of finding subgraphs with hereditary properties. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778577 | 2002-11-18 | Paper |
| A tradeoff between search and update in dictionaries | 2002-07-25 | Paper |
| Selecting small ranks in EREW PRAM | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766822 | 2002-07-22 | Paper |
| Succinct representation of balanced parentheses and static trees | 2002-04-23 | Paper |
| Representing dynamic binary trees succinctly | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511230 | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4519727 | 2001-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511215 | 2001-02-27 | Paper |
| Space efficient suffix trees | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4719333 | 2000-10-17 | Paper |
| The complexity of irredundant sets parameterized by size | 2000-03-22 | Paper |
| Parameterizing above Guaranteed Values: MaxSat and MaxCut | 1999-09-29 | Paper |
| Selection from read-only memory and sorting with minimum data movement | 1997-02-27 | Paper |
| Fast stable in-place sorting with \(O(n)\) data moves | 1996-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037442 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028918 | 1993-03-28 | Paper |
| Sorting with minimum data movement | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983244 | 1992-06-27 | Paper |
| Stable in situ sorting and minimum data movement | 1990-01-01 | Paper |
