| Publication | Date of Publication | Type |
|---|
| Optimal LZ-end parsing is hard | 2024-10-21 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2024-05-16 | Paper |
| Polynomial-delay enumeration of maximal common subsequences | 2024-04-19 | Paper |
| Fast identification of heavy hitters by cached and packed group testing | 2024-04-19 | Paper |
| Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay | 2024-03-27 | Paper |
| On the hardness of inclusion-wise minimal separators enumeration | 2024-03-13 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2023-10-12 | Paper |
| An algorithm for enumerating all directed spanning trees in a directed graph | 2023-01-25 | Paper |
| Proximity Search for Maximal Subgraph Enumeration | 2022-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092436 | 2022-07-21 | Paper |
| Efficient enumeration of dominating sets for sparse graphs | 2022-07-21 | Paper |
| Enumeration of maximal common subsequences between two strings | 2022-03-22 | Paper |
| Efficient enumeration of dominating sets for sparse graphs | 2021-09-15 | Paper |
| Maximal strongly connected cliques in directed graphs: algorithms and bounds | 2021-09-15 | Paper |
| A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number | 2021-06-22 | Paper |
| On the dualization in distributive lattices and related problems | 2021-06-07 | Paper |
| Listing Maximal Independent Sets with Minimal Space and Bounded Delay | 2021-02-16 | Paper |
| On maximal cliques with connectivity constraints in directed graphs | 2020-11-25 | Paper |
| Exact algorithms for the max-min dispersion problem | 2020-07-07 | Paper |
| Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph | 2020-04-07 | Paper |
| An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs | 2020-02-25 | Paper |
| Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs | 2020-02-25 | Paper |
| Max-Min 3-Dispersion problems | 2020-02-24 | Paper |
| New polynomial delay bounds for maximal subgraph enumeration by proximity search | 2020-01-30 | Paper |
| An efficient algorithm for enumerating induced subgraphs with bounded degeneracy | 2019-10-11 | Paper |
| Efficient algorithms for dualizing large-scale hypergraphs | 2019-09-12 | Paper |
| On the dualization in distributive lattices and related problems | 2019-02-19 | Paper |
| Sequentially swapping colored tokens on graphs | 2019-02-14 | Paper |
| Tight lower bounds for the number of inclusion-minimal \(st\)-cuts | 2018-11-22 | Paper |
| Efficient enumeration of bipartite subgraphs in graphs | 2018-10-04 | Paper |
| Efficient enumeration of subgraphs and induced subgraphs with bounded girth | 2018-09-06 | Paper |
| Computational complexity of robot arm simulation problems | 2018-09-06 | Paper |
| Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs | 2018-03-26 | Paper |
| Approximation and hardness of token swapping | 2018-03-02 | Paper |
| Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph | 2017-10-23 | Paper |
| Counting minimal dominating sets | 2017-05-19 | Paper |
| Sequentially swapping colored tokens on graphs | 2017-05-05 | Paper |
| Mining preserving structures in a graph sequence | 2016-11-24 | Paper |
| A partition-based heuristic algorithm for the rectilinear block packing problem | 2016-10-27 | Paper |
| A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs | 2016-10-21 | Paper |
| Efficient algorithms for a simple network design problem | 2016-06-10 | Paper |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 2016-01-18 | Paper |
| Polynomial delay algorithm for listing minimal edge dominating sets in graphs | 2015-10-30 | Paper |
| Constant time enumeration by amortization | 2015-10-30 | Paper |
| Mining preserving structures in a graph sequence | 2015-10-29 | Paper |
| Efficient enumeration of induced subtrees in a K-degenerate graph | 2015-09-11 | Paper |
| Swapping labeled tokens on graphs | 2015-05-26 | Paper |
| Base-object location problems for base-monotone regions | 2014-10-06 | Paper |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2014-07-07 | Paper |
| Efficient algorithms for dualizing large-scale hypergraphs | 2014-05-06 | Paper |
| UNO is hard, even for a single player | 2014-01-22 | Paper |
| On the enumeration and counting of minimal dominating sets in interval and permutation graphs | 2014-01-14 | Paper |
| On complexity of flooding games on graphs with interval representations | 2013-12-06 | Paper |
| Hardness results and an exact exponential algorithm for the spanning tree congestion problem | 2013-11-28 | Paper |
| A doubly exponentially crumbled cake | 2013-11-01 | Paper |
| Bounding the number of reduced trees, cographs, and series-parallel graphs by compression | 2013-09-05 | Paper |
| Base Location Problems for Base-Monotone Regions | 2013-04-12 | Paper |
| Efficient Computation of Power Indices for Weighted Majority Games | 2013-03-21 | Paper |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2013-03-21 | Paper |
| Finding maximum edge bicliques in convex bipartite graphs | 2012-11-21 | Paper |
| Subgraph isomorphism in graph classes | 2012-10-16 | Paper |
| Constant time enumeration of bounded-size subtrees in trees and its application | 2012-09-25 | Paper |
| A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares | 2012-08-14 | Paper |
| Bounding the number of reduced trees, cographs, and series-parallel graphs by compression | 2012-06-08 | Paper |
| Partitioning a weighted tree into subtrees with weights in a given range | 2012-04-26 | Paper |
| Algorithmic folding complexity | 2012-01-24 | Paper |
| Dominating Set Counting in Graph Classes | 2011-08-17 | Paper |
| Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width | 2011-07-01 | Paper |
| Hardness results and an exact exponential algorithm for the spanning tree congestion problem | 2011-07-01 | Paper |
| A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization | 2011-03-22 | Paper |
| Matroid representation of clique complexes | 2011-03-18 | Paper |
| Levelwise mesh sparsification for shortest path queries | 2010-12-09 | Paper |
| Enumeration of the perfect sequences of a chordal graph | 2010-10-11 | Paper |
| Finding maximum edge bicliques in convex bipartite graphs | 2010-07-20 | Paper |
| On listing, sampling, and counting the chordal graphs with edge constraints | 2010-06-07 | Paper |
| An efficient algorithm for solving pseudo clique enumeration problem | 2010-02-23 | Paper |
| Counting the number of matchings in chordal and chordal bipartite graph classes | 2010-01-21 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Transforming spanning trees: A lower bound | 2009-06-30 | Paper |
| Enumerating Minimally Revised Specifications Using Dualization | 2009-03-26 | Paper |
| Partitioning a Weighted Tree to Subtrees of Almost Uniform Size | 2009-01-29 | Paper |
| Enumeration of Perfect Sequences of Chordal Graph | 2009-01-29 | Paper |
| An iterated local search algorithm for the vehicle routing problem with convex time penalty functions | 2008-09-10 | Paper |
| Listing Chordal Graphs and Interval Graphs | 2008-09-04 | Paper |
| Counting the number of independent sets in chordal graphs | 2008-08-08 | Paper |
| On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints | 2008-07-10 | Paper |
| A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization | 2008-05-27 | Paper |
| An Efficient Algorithm for Enumerating Pseudo Cliques | 2008-05-27 | Paper |
| A generalization of magic squares with applications to digital halftoning | 2008-04-03 | Paper |
| Polynomial time algorithms for maximizing the intersection volume of polytopes | 2008-02-22 | Paper |
| A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs | 2007-11-13 | Paper |
| Efficient Algorithms for Airline Problem | 2007-11-13 | Paper |
| Matroid representation of clique complexes | 2007-09-19 | Paper |
| Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps | 2007-08-28 | Paper |
| An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence | 2007-07-19 | Paper |
| On the enumeration of bipartite minimum edge colorings | 2007-03-05 | Paper |
| An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Inductive Logic Programming | 2006-11-01 | Paper |
| A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS | 2006-06-14 | Paper |
| Heuristic approaches to the capacitated square covering problem | 2006-02-08 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673411 | 2005-04-29 | Paper |
| AN O(n^2 log^2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING | 2005-01-31 | Paper |
| Labeling points with weights | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474103 | 2004-08-04 | Paper |
| A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM | 2003-05-20 | Paper |
| A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis | 2002-09-17 | Paper |
| A cutting plane algorithm for semi-definite programming problems with applications to failure discrimination and cancer diagnosis | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761872 | 2001-02-21 | Paper |
| Fast algorithms to enumerate all common intervals of two permutations | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938674 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703155 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370201 | 1998-10-19 | Paper |
| An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs | 1997-05-26 | Paper |
