| Publication | Date of Publication | Type |
|---|
| Dynamic controllability of temporal networks with instantaneous reaction | 2024-04-11 | Paper |
| Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay | 2024-03-27 | Paper |
| Refined bounds on the number of Eulerian tours in undirected graphs | 2024-01-09 | Paper |
| Hardness of \textsc{Balanced Mobiles} | 2023-12-22 | Paper |
| Solving the probabilistic profitable tour problem on a line | 2023-10-26 | Paper |
| Decomposing subcubic graphs into claws, paths or triangles | 2023-10-04 | Paper |
| An interdisciplinary experimental evaluation on the disjunctive temporal problem | 2023-10-02 | Paper |
| Algorithmic aspects of small quasi-kernels | 2023-05-05 | Paper |
| On recognising words that are squares for the shuffle product | 2023-04-26 | Paper |
| Dynamic controllability made simple | 2023-02-03 | Paper |
| Incorporating decision nodes into conditional simple temporal networks | 2023-02-03 | Paper |
| A streamlined model of conditional simple temporal networks -- semantics and equivalence results | 2023-02-03 | Paper |
| Cut paths and their remainder structure, with applications | 2022-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5087784 | 2022-07-01 | Paper |
| A linear-time parameterized algorithm for computing the width of a DAG | 2022-06-08 | Paper |
| Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty | 2022-05-28 | Paper |
| On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier | 2022-05-28 | Paper |
| Safety in \(s\)-\(t\) paths, trails and walks | 2022-03-22 | Paper |
| A simplified algorithm computing all \(s-t\) bridges and articulation points | 2021-10-21 | Paper |
| Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way | 2021-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005188 | 2021-08-04 | Paper |
| Checking Sets of Pure Evolving Association Rules | 2021-06-04 | Paper |
| When a dollar makes a BWT | 2021-01-25 | Paper |
| Some simple distributed algorithms for sparse networks | 2020-12-03 | Paper |
| The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly | 2020-11-25 | Paper |
| Optimal Omnitig Listing for Safe and Complete Contig Assembly | 2020-05-25 | Paper |
| Sorting with forbidden intermediates | 2020-05-18 | Paper |
| Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks | 2020-04-22 | Paper |
| Genome assembly, from practice to theory: safe, complete and linear-time | 2020-02-24 | Paper |
| An Optimal O ( nm ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph | 2019-12-02 | Paper |
| Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution | 2019-11-07 | Paper |
| Faster FPTASes for counting and random generation of knapsack solutions | 2019-05-29 | Paper |
| Optimal Listing of Cycles and st-Paths in Undirected Graphs | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4557834 | 2018-11-26 | Paper |
| Tight lower bounds for the number of inclusion-minimal \(st\)-cuts | 2018-11-22 | Paper |
| Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem | 2018-11-13 | Paper |
| An improved upper bound on maximal clique listing via rectangular fast matrix multiplication | 2018-10-18 | Paper |
| Pattern matching for separable permutations | 2018-10-17 | Paper |
| Network Synthesis for Distributed Embedded Systems | 2018-09-20 | Paper |
| Pattern matching for \(k\)-track permutations | 2018-09-06 | Paper |
| New Bounds for Approximating Extremal Distances in Undirected Graphs | 2018-07-16 | Paper |
| The Complexity of Simulation and Matrix Multiplication | 2018-07-16 | Paper |
| Efficient enumeration of graph orientations with sources | 2018-06-27 | Paper |
| Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games | 2018-03-28 | Paper |
| Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm | 2018-03-21 | Paper |
| On bubble generators in directed graphs | 2018-01-04 | Paper |
| The minimum conflict-free row split problem revisited | 2018-01-04 | Paper |
| Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games | 2017-05-02 | Paper |
| Minimal Multiset Grammars for Recurrent Dynamics | 2017-04-12 | Paper |
| Solving the train marshalling problem by inclusion-exclusion | 2017-03-15 | Paper |
| Sorting with forbidden intermediates | 2016-10-06 | Paper |
| Directing Road Networks by Listing Strong Orientations | 2016-09-29 | Paper |
| Decomposing Cubic Graphs into Connected Subgraphs of Size Three | 2016-09-02 | Paper |
| On the Complexity of Computing the Excessive [B-Index of a Graph] | 2016-06-10 | Paper |
| Improving a family of approximation algorithms to edge color multigraphs | 2016-06-09 | Paper |
| Finding a Forest in a Tree | 2016-06-09 | Paper |
| Listing Acyclic Orientations of Graphs with Single and Multiple Sources | 2016-05-03 | Paper |
| Enumerating Cyclic Orientations of a Graph | 2016-04-04 | Paper |
| The complexity of power indexes with graph restricted coalitions | 2015-12-18 | Paper |
| Efficiently Listing Bounded Length st-Paths | 2015-09-15 | Paper |
| Some results on more flexible versions of Graph Motif | 2015-07-20 | Paper |
| On the complexity of the vector connectivity problem | 2015-07-13 | Paper |
| Friendly bin packing instances without integer round-up property | 2015-04-16 | Paper |
| Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs | 2014-10-08 | Paper |
| Faster FPTASes for Counting and Random Generation of Knapsack Solutions | 2014-10-08 | Paper |
| Some algorithmic results for [2-sumset covers] | 2014-10-07 | Paper |
| Cycle bases in graphs characterization, algorithms, complexity, and applications | 2014-10-07 | Paper |
| Dominating sequences in graphs | 2014-09-04 | Paper |
| Set graphs. II. Complexity of set graph recognition and similar problems | 2014-07-25 | Paper |
| Polynomial time complexity of edge colouring graphs with bounded colour classes | 2014-07-03 | Paper |
| Complexity insights of the minimum duplication problem | 2014-03-27 | Paper |
| MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS | 2013-07-30 | Paper |
| On Recognizing Words That Are Squares for the Shuffle Product | 2013-06-14 | Paper |
| Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph | 2013-03-21 | Paper |
| Ranking, unranking and random generation of extensional acyclic digraphs | 2013-03-21 | Paper |
| A faster algorithm for finding minimum Tucker submatrices | 2012-12-07 | Paper |
| Some Results on more Flexible Versions of Graph Motif | 2012-09-10 | Paper |
| An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval | 2012-07-16 | Paper |
| Complexity Insights of the Minimum Duplication Problem | 2012-06-15 | Paper |
| Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms | 2012-06-08 | Paper |
| Approximation of RNA multiple structural alignment | 2012-01-04 | Paper |
| Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs | 2011-09-16 | Paper |
| A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row | 2011-06-17 | Paper |
| On the approximability of the minimum strictly fundamental cycle basis problem | 2011-03-09 | Paper |
| Excessive factorizations of bipartite multigraphs | 2010-11-05 | Paper |
| A Faster Algorithm for Finding Minimum Tucker Submatrices | 2010-07-29 | Paper |
| Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs | 2010-06-22 | Paper |
| Finding common structured patterns in linear graphs | 2010-06-07 | Paper |
| Optimal receiver scheduling algorithms for a multicast problem | 2010-04-28 | Paper |
| New length bounds for cycle bases | 2010-03-24 | Paper |
| MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS | 2010-03-11 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Complexity issues in color-preserving graph embeddings | 2010-02-09 | Paper |
| Approximating the maximum 3-edge-colorable subgraph problem | 2009-12-09 | Paper |
| A greedy approach to compute a minimum cycle basis of a directed graph | 2009-12-04 | Paper |
| Breaking the O(m 2 n) Barrier for Minimum Cycle Bases | 2009-10-29 | Paper |
| High Performance Computing - HiPC 2003 | 2009-08-11 | Paper |
| The optimal statistical median of a convex set of arrays | 2009-08-06 | Paper |
| Lower bounds for strictly fundamental cycle bases in grid graphs | 2009-07-28 | Paper |
| Minimum weakly fundamental cycle bases are hard to find | 2009-06-17 | Paper |
| Finding occurrences of protein complexes in protein-protein interaction graphs | 2009-04-16 | Paper |
| On the complexity of digraph packings | 2009-03-23 | Paper |
| On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic | 2009-03-23 | Paper |
| Genomes Containing Duplicates Are Hard to Compare | 2008-12-09 | Paper |
| The minimum substring cover problem | 2008-12-03 | Paper |
| FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING | 2008-11-03 | Paper |
| Common Structured Patterns in Linear Graphs: Approximation and Combinatorics | 2008-06-17 | Paper |
| Oriented star packings | 2008-04-28 | Paper |
| What Makes the Arc-Preserving Subsequence Problem Hard? | 2008-03-19 | Paper |
| Pattern Matching in Protein-Protein Interaction Graphs | 2008-02-26 | Paper |
| The Minimum Substring Cover Problem | 2008-02-20 | Paper |
| Benchmarks for Strictly Fundamental Cycle Bases | 2008-01-02 | Paper |
| Least and most colored bases | 2007-09-19 | Paper |
| Approximation of RNA Multiple Structural Alignment | 2007-09-14 | Paper |
| The firefighter problem for graphs of maximum degree three | 2007-06-26 | Paper |
| Classes of cycle bases | 2007-03-02 | Paper |
| A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem | 2006-10-25 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Covering partially directed graphs with directed paths | 2006-08-04 | Paper |
| Acyclically pushable bipartite permutation digraphs: an algorithm | 2006-08-04 | Paper |
| A polynomial case of the parsimony haplotyping problem | 2006-06-30 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Polynomial and APX-hard cases of the individual haplotyping problem | 2005-06-10 | Paper |
| Channel assignment for interference avoidance in honeycomb wireless networks | 2005-01-31 | Paper |
| Ond-threshold graphs andd-dimensional bin packing | 2005-01-12 | Paper |
| Combinatorial optimization -- polyhedra and efficiency: a book review | 2004-10-28 | Paper |
| Packing cuts in undirected graphs | 2004-08-20 | Paper |
| Packing cycles in undirected graphs | 2004-03-14 | Paper |
| Routing permutations in partitioned optical passive stars networks. | 2003-12-04 | Paper |
| Packing paths in digraphs | 2003-10-29 | Paper |
| A simple minimum \(T\)-cut algorithm | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408101 | 2003-07-02 | Paper |
| Cycle cover property and \(\text{CPP}=\text{SCC}\) property are not equivalent | 2003-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796199 | 2003-03-02 | Paper |
| Packing triangles in bounded degree graphs. | 2003-01-21 | Paper |
| Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs | 2003-01-05 | Paper |
| Minimum \(T\)-cuts and optimal \(T\)-pairings | 2002-12-02 | Paper |
| Excluding a simple good pair approach to directed cuts | 2002-08-28 | Paper |
| Improved approximation for breakpoint graph decomposition and sorting by reversals | 2002-05-28 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4948507 A short proof of K�nig's matching theorem] | 2002-03-14 | Paper |
| On the recognition of \(P_4\)-indifferent graphs | 2002-02-17 | Paper |
| On 4-connected graphs without even cycle decompositions | 2001-07-02 | Paper |
| A note on range-restricted circuit covers | 2001-06-28 | Paper |
| Shortest paths in conservative graphs | 2001-05-21 | Paper |
| On minimizing symmetric set functions | 2001-04-01 | Paper |
| Edge-Coloring Bipartite Graphs | 2000-06-22 | Paper |
| Indecomposabler-graphs and some other counterexamples | 1999-09-22 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4242913 K�nig's edge coloring theorem without augmenting paths] | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4239648 | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224923 | 1999-04-11 | Paper |
