| Publication | Date of Publication | Type |
|---|
Quasi-kernels in split graphs
Discrete Applied Mathematics | 2025-01-06 | Paper |
New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
Discrete Applied Mathematics | 2025-01-06 | Paper |
Recognizing unit multiple interval graphs is hard
Discrete Applied Mathematics | 2024-12-04 | Paper |
Predictive mining of multi-temporal relations
Information and Computation | 2024-12-03 | Paper |
Cut paths and their remainder structure, with applications
| 2024-10-08 | Paper |
Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
| 2024-07-19 | Paper |
Dynamic controllability of temporal networks with instantaneous reaction
Information Sciences | 2024-04-11 | Paper |
Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay
Discrete Applied Mathematics | 2024-03-27 | Paper |
Refined bounds on the number of Eulerian tours in undirected graphs
Algorithmica | 2024-01-09 | Paper |
Hardness of \textsc{Balanced Mobiles}
Lecture Notes in Computer Science | 2023-12-22 | Paper |
Solving the probabilistic profitable tour problem on a line
Optimization Letters | 2023-10-26 | Paper |
Decomposing subcubic graphs into claws, paths or triangles
Journal of Graph Theory | 2023-10-04 | Paper |
An interdisciplinary experimental evaluation on the disjunctive temporal problem
Constraints | 2023-10-02 | Paper |
Algorithmic aspects of small quasi-kernels
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
On recognising words that are squares for the shuffle product
Theoretical Computer Science | 2023-04-26 | Paper |
Dynamic controllability made simple
1515.68289 | 2023-02-03 | Paper |
Incorporating decision nodes into conditional simple temporal networks
1515.68287 | 2023-02-03 | Paper |
A streamlined model of conditional simple temporal networks -- semantics and equivalence results
1515.68288 | 2023-02-03 | Paper |
Hybrid SAT-based consistency checking algorithms for simple temporal networks with decisions
| 2023-02-03 | Paper |
Cut paths and their remainder structure, with applications
| 2022-10-14 | Paper |
Random generation of essential directed acyclic graphs
| 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
Algorithmica | 2022-03-22 | Paper |
A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points
Discrete Applied Mathematics | 2021-10-21 | Paper |
Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
Information and Computation | 2021-09-21 | Paper |
Listing subgraphs by Cartesian decomposition
| 2021-08-04 | Paper |
Checking sets of pure evolving association rules
Fundamenta Informaticae | 2021-06-04 | Paper |
When a dollar makes a BWT
Theoretical Computer Science | 2021-01-25 | Paper |
Some simple distributed algorithms for sparse networks
Distributed Computing | 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
Discrete Applied Mathematics | 2020-05-18 | Paper |
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks
Journal of Logical and Algebraic Methods in Programming | 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
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
Theoretical Computer Science | 2019-11-07 | Paper |
Faster FPTASes for counting and random generation of knapsack solutions
Information and Computation | 2019-05-29 | Paper |
Optimal listing of cycles and \(st\)-paths in undirected graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Permutation pattern matching in \((213,231)\)-avoiding permutations
| 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
ACM Transactions on Algorithms | 2018-11-13 | Paper |
An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
Algorithmica | 2018-10-18 | Paper |
Pattern matching for separable permutations
| 2018-10-17 | Paper |
Network Synthesis for Distributed Embedded Systems
IEEE Transactions on Computers | 2018-09-20 | Paper |
Pattern matching for \(k\)-track permutations
| 2018-09-06 | Paper |
The complexity of simulation and matrix multiplication
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
New bounds for approximating extremal distances in undirected graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Efficient enumeration of graph orientations with sources
Discrete Applied Mathematics | 2018-06-27 | Paper |
Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
Constraints | 2018-03-28 | Paper |
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm
Information and Computation | 2018-03-21 | Paper |
The minimum conflict-free row split problem revisited
| 2018-01-04 | Paper |
On bubble generators in directed graphs
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
Algorithmica | 2017-05-02 | Paper |
Minimal multiset grammars for recurrent dynamics
Membrane Computing | 2017-04-12 | Paper |
Solving the train marshalling problem by inclusion-exclusion
Discrete Applied Mathematics | 2017-03-15 | Paper |
Sorting with forbidden intermediates
Lecture Notes in Computer Science | 2016-10-06 | Paper |
Directing Road Networks by Listing Strong Orientations
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Decomposing cubic graphs into connected subgraphs of size three
Lecture Notes in Computer Science | 2016-09-02 | Paper |
On the complexity of computing the excessive \([B\)-index of a graph]
Journal of Graph Theory | 2016-06-10 | Paper |
Improving a family of approximation algorithms to edge color multigraphs
Information Processing Letters | 2016-06-09 | Paper |
Finding a forest in a tree
Trustworthy Global Computing | 2016-06-09 | Paper |
Listing Acyclic Orientations of Graphs with Single and Multiple Sources
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Enumerating cyclic orientations of a graph
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Strong cliques and equistability of EPT graphs
Discrete Applied Mathematics | 2016-03-18 | Paper |
The complexity of power indexes with graph restricted coalitions
Mathematical Social Sciences | 2015-12-18 | Paper |
Efficiently listing bounded length \(st\)-paths
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Some results on more flexible versions of Graph Motif
Theory of Computing Systems | 2015-07-20 | Paper |
On the complexity of the vector connectivity problem
Theoretical Computer Science | 2015-07-13 | Paper |
Friendly bin packing instances without integer round-up property
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Faster FPTASes for counting and random generation of knapsack solutions
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review | 2014-10-07 | Paper |
Some algorithmic results for [2-sumset covers]
Information Processing Letters | 2014-10-07 | Paper |
Dominating sequences in graphs
Discrete Mathematics | 2014-09-04 | Paper |
Set graphs. II. Complexity of set graph recognition and similar problems
Theoretical Computer Science | 2014-07-25 | Paper |
Polynomial time complexity of edge colouring graphs with bounded colour classes
Algorithmica | 2014-07-03 | Paper |
Complexity insights of the minimum duplication problem
Theoretical Computer Science | 2014-03-27 | Paper |
Minimum mosaic inference of a set of recombinants
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
On recognizing words that are squares for the shuffle product
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Ranking, unranking and random generation of extensional acyclic digraphs
Information Processing Letters | 2013-03-21 | Paper |
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
Algorithms and Computation | 2013-03-21 | Paper |
A faster algorithm for finding minimum Tucker submatrices
Theory of Computing Systems | 2012-12-07 | Paper |
Some results on more flexible versions of Graph Motif
Computer Science – Theory and Applications | 2012-09-10 | Paper |
An algorithmic view on multi-related-segments: a unifying model for approximate common interval
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Complexity insights of the minimum duplication problem
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
INFORMS Journal on Computing | 2012-06-08 | Paper |
Approximation of RNA multiple structural alignment
Journal of Discrete Algorithms | 2012-01-04 | Paper |
Output-sensitive listing of bounded-size trees in undirected graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
A polynomial-time algorithm for finding a minimal conflicting set containing a given row
Computer Science – Theory and Applications | 2011-06-17 | Paper |
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics | 2011-03-09 | Paper |
Excessive factorizations of bipartite multigraphs
Discrete Applied Mathematics | 2010-11-05 | Paper |
A faster algorithm for finding minimum Tucker submatrices
Programs, Proofs, Processes | 2010-07-29 | Paper |
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Finding common structured patterns in linear graphs
Theoretical Computer Science | 2010-06-07 | Paper |
Optimal receiver scheduling algorithms for a multicast problem
Discrete Applied Mathematics | 2010-04-28 | Paper |
New length bounds for cycle bases
Information Processing Letters | 2010-03-24 | Paper |
Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
Discrete Mathematics, Algorithms and Applications | 2010-03-11 | Paper |
More reliable protein NMR peak assignment via improved 2-interval scheduling
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Complexity issues in color-preserving graph embeddings
Theoretical Computer Science | 2010-02-09 | Paper |
Approximating the maximum 3-edge-colorable subgraph problem
Discrete Mathematics | 2009-12-09 | Paper |
A greedy approach to compute a minimum cycle basis of a directed graph
Information Processing Letters | 2009-12-04 | Paper |
Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
Lecture Notes in Computer Science | 2009-10-29 | Paper |
High Performance Computing - HiPC 2003
Lecture Notes in Computer Science | 2009-08-11 | Paper |
The optimal statistical median of a convex set of arrays
Journal of Global Optimization | 2009-08-06 | Paper |
Lower bounds for strictly fundamental cycle bases in grid graphs
Networks | 2009-07-28 | Paper |
Minimum weakly fundamental cycle bases are hard to find
Algorithmica | 2009-06-17 | Paper |
Finding occurrences of protein complexes in protein-protein interaction graphs
Journal of Discrete Algorithms | 2009-04-16 | Paper |
On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic
Information Processing Letters | 2009-03-23 | Paper |
On the complexity of digraph packings
Information Processing Letters | 2009-03-23 | Paper |
Genomes Containing Duplicates Are Hard to Compare
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
The minimum substring cover problem
Information and Computation | 2008-12-03 | Paper |
FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Oriented star packings
Journal of Combinatorial Theory. Series B | 2008-04-28 | Paper |
What Makes the Arc-Preserving Subsequence Problem Hard?
Transactions on Computational Systems Biology II | 2008-03-19 | Paper |
Pattern Matching in Protein-Protein Interaction Graphs
Fundamentals of Computation Theory | 2008-02-26 | Paper |
The Minimum Substring Cover Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
Benchmarks for Strictly Fundamental Cycle Bases
Experimental Algorithms | 2008-01-02 | Paper |
Least and most colored bases
Discrete Applied Mathematics | 2007-09-19 | Paper |
Approximation of RNA Multiple Structural Alignment
Combinatorial Pattern Matching | 2007-09-14 | Paper |
The firefighter problem for graphs of maximum degree three
Discrete Mathematics | 2007-06-26 | Paper |
Classes of cycle bases
Discrete Applied Mathematics | 2007-03-02 | Paper |
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
European Journal of Operational Research | 2006-10-25 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Covering partially directed graphs with directed paths
Discrete Mathematics | 2006-08-04 | Paper |
Acyclically pushable bipartite permutation digraphs: an algorithm
Discrete Mathematics | 2006-08-04 | Paper |
A polynomial case of the parsimony haplotyping problem
Operations Research Letters | 2006-06-30 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Polynomial and APX-hard cases of the individual haplotyping problem
Theoretical Computer Science | 2005-06-10 | Paper |
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing | 2005-01-31 | Paper |
Ond-threshold graphs andd-dimensional bin packing
Networks | 2005-01-12 | Paper |
Combinatorial optimization -- polyhedra and efficiency: a book review
4OR | 2004-10-28 | Paper |
Packing cuts in undirected graphs
Networks | 2004-08-20 | Paper |
Packing cycles in undirected graphs
Journal of Algorithms | 2004-03-14 | Paper |
Routing permutations in partitioned optical passive stars networks.
Journal of Parallel and Distributed Computing | 2003-12-04 | Paper |
Packing paths in digraphs
Journal of Graph Theory | 2003-10-29 | Paper |
A simple minimum \(T\)-cut algorithm
Discrete Applied Mathematics | 2003-09-09 | Paper |
scientific article; zbMATH DE number 1945152 (Why is no real title available?)
| 2003-07-02 | Paper |
Cycle cover property and \(\text{CPP}=\text{SCC}\) property are not equivalent
Discrete Mathematics | 2003-03-16 | Paper |
scientific article; zbMATH DE number 1875440 (Why is no real title available?)
| 2003-03-02 | Paper |
Packing triangles in bounded degree graphs.
Information Processing Letters | 2003-01-21 | Paper |
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Minimum \(T\)-cuts and optimal \(T\)-pairings
Discrete Mathematics | 2002-12-02 | Paper |
Excluding a simple good pair approach to directed cuts
Graphs and Combinatorics | 2002-08-28 | Paper |
Improved approximation for breakpoint graph decomposition and sorting by reversals
Journal of Combinatorial Optimization | 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
Discrete Mathematics | 2002-02-17 | Paper |
On 4-connected graphs without even cycle decompositions
Discrete Mathematics | 2001-07-02 | Paper |
A note on range-restricted circuit covers
Graphs and Combinatorics | 2001-06-28 | Paper |
Shortest paths in conservative graphs
Discrete Mathematics | 2001-05-21 | Paper |
On minimizing symmetric set functions
Combinatorica | 2001-04-01 | Paper |
Edge-Coloring Bipartite Graphs
Journal of Algorithms | 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 |
scientific article; zbMATH DE number 1279089 (Why is no real title available?)
| 1999-04-26 | Paper |
scientific article; zbMATH DE number 1241383 (Why is no real title available?)
| 1999-04-11 | Paper |
Quasi-kernels in split graphs
| N/A | Paper |
