| Publication | Date of Publication | Type |
|---|
| On Seymour's and Sullivan's second neighbourhood conjectures | 2024-01-30 | Paper |
| Note on Disjoint Cycles in Multipartite Tournaments | 2023-11-22 | Paper |
| Component order connectivity in directed graphs | 2023-11-13 | Paper |
| Perfect forests in graphs and their extensions | 2023-10-05 | Paper |
| Kings in multipartite hypertournaments | 2023-10-04 | Paper |
| Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments | 2023-09-29 | Paper |
| \((1,1)\)-cluster editing is polynomial-time solvable | 2023-09-14 | Paper |
| Unique stable matchings | 2023-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168471 | 2023-08-08 | Paper |
| Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem | 2023-07-03 | Paper |
| Lower Bounds for Maximum Weighted Cut | 2023-06-22 | Paper |
| Results on the small quasi-kernel conjecture | 2023-05-15 | Paper |
| Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp1 | 2023-05-05 | Paper |
| Preference swaps for the stable matching problem | 2023-04-20 | Paper |
| Bounds on Maximum Weight Directed Cut | 2023-04-20 | Paper |
| Exact capacitated domination: on the computational complexity of uniqueness | 2023-04-17 | Paper |
| Fixed parameterized algorithms for generalized feedback vertex set problems | 2023-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874290 | 2023-02-07 | Paper |
| Constructing edge-disjoint Steiner trees in Cartesian product networks | 2023-01-26 | Paper |
| \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms | 2023-01-06 | Paper |
| Proper orientation, proper biorientation and semi-proper orientation numbers of graphs | 2023-01-04 | Paper |
| Smallest number of vertices in a 2-arc-strong digraph without good pairs | 2022-10-21 | Paper |
| Extended path partition conjecture for semicomplete and acyclic compositions | 2022-08-24 | Paper |
| Component order connectivity in directed graphs | 2022-08-18 | Paper |
| Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths | 2022-07-13 | Paper |
| The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings | 2022-06-29 | Paper |
| On \(d\)-panconnected tournaments with large semidegrees | 2022-05-27 | Paper |
| Proper orientation number of triangle‐free bridgeless outerplanar graphs | 2022-03-31 | Paper |
| Arc‐disjoint strong spanning subdigraphs of semicomplete compositions | 2022-03-31 | Paper |
| r -Simple k -Path and Related Problems Parameterized by k / r | 2022-02-08 | Paper |
| Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs | 2022-01-22 | Paper |
| Preference Swaps for the Stable Matching Problem | 2021-12-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993600 | 2021-06-15 | Paper |
| Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games | 2021-04-21 | Paper |
| Parameterized Pre-Coloring Extension and List Coloring Problems | 2021-03-30 | Paper |
| Proximity and remoteness in directed and undirected graphs | 2021-01-27 | Paper |
| The smallest number of vertices in a 2-arc-strong digraph which has no good pair | 2020-12-07 | Paper |
| k-Distinct In- and Out-Branchings in Digraphs | 2020-05-27 | Paper |
| Path-Contractions, Edge Deletions and Connectivity Preservation | 2020-05-27 | Paper |
| Note on semi-proper orientations of outerplanar graphs | 2020-04-15 | Paper |
| Exact capacitated domination: on the computational complexity of uniqueness | 2020-03-16 | Paper |
| Alternative parameterizations of \textsc{Metric Dimension} | 2020-01-16 | Paper |
| Parameterized resiliency problems | 2019-10-18 | Paper |
| On r-Simple k-Path and Related Problems Parameterized by k/r | 2019-10-15 | Paper |
| Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints | 2019-09-13 | Paper |
| Branching in digraphs with many and few leaves: structural and algorithmic results | 2019-07-25 | Paper |
| Clustering without replication in combinatorial circuits | 2019-06-25 | Paper |
| Basic Terminology, Notation and Results | 2019-03-04 | Paper |
| Acyclic Digraphs | 2019-03-04 | Paper |
| Path-contractions, edge deletions and connectivity preservation | 2019-01-25 | Paper |
| Strong Subgraph Connectivity of Digraphs: A Survey | 2018-08-08 | Paper |
| Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials | 2018-05-08 | Paper |
| \(k\)-distinct in- and out-branchings in digraphs | 2018-05-08 | Paper |
| Strong subgraph $k$-arc-connectivity | 2018-05-04 | Paper |
| Strong subgraph $k$-connectivity bounds | 2018-03-01 | Paper |
| Note on maximal bisection above tight lower bound | 2017-11-03 | Paper |
| Parameterized Resiliency Problems via Integer Linear Programming | 2017-07-21 | Paper |
| Note on Perfect Forests in Digraphs | 2017-07-05 | Paper |
| Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs | 2017-04-05 | Paper |
| Odd properly colored cycles in edge-colored graphs | 2017-02-06 | Paper |
| A Multivariate Approach for Checking Resiliency in Access Control | 2016-11-09 | Paper |
| Rural postman parameterized by the number of components of required edges | 2016-09-16 | Paper |
| Polynomial kernels and user reductions for the workflow satisfiability problem | 2016-09-07 | Paper |
| Note on Perfect Forests | 2016-08-12 | Paper |
| Parameterized Traveling Salesman Problem: Beating the Average | 2016-02-05 | Paper |
| Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis | 2016-01-05 | Paper |
| Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints | 2015-11-12 | Paper |
| Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem | 2015-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417644 | 2014-05-22 | Paper |
| Parameterized complexity of \(k\)-Chinese postman problem | 2014-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867371 | 2013-12-11 | Paper |
| Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value | 2013-12-02 | Paper |
| Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems | 2013-07-04 | Paper |
| (Non-)existence of polynomial kernels for the test cover problem | 2013-03-20 | Paper |
| Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming | 2012-11-21 | Paper |
| Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width | 2012-10-26 | Paper |
| An algorithm for finding input-output constrained convex sets in an acyclic digraph | 2012-09-13 | Paper |
| Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey | 2012-09-05 | Paper |
| Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem | 2012-08-16 | Paper |
| Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables | 2012-05-11 | Paper |
| Solving MAX-\(r\)-SAT above a tight lower bound | 2011-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012393 | 2011-07-06 | Paper |
| Local search heuristics for the multidimensional assignment problem | 2011-06-16 | Paper |
| Vertex cover problem parameterized above and below tight bounds | 2011-03-30 | Paper |
| A probabilistic approach to problems parameterized above or below tight bounds | 2011-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084797 | 2011-03-25 | Paper |
| Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem | 2011-01-28 | Paper |
| Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming | 2010-12-07 | Paper |
| Betweenness parameterized above tight lower bound | 2010-10-07 | Paper |
| Spectral Theory and Analysis | 2010-09-13 | Paper |
| All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565872 | 2010-06-07 | Paper |
| The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops | 2010-05-05 | Paper |
| A memetic algorithm for the generalized traveling salesman problem | 2010-05-05 | Paper |
| On complexity of minimum leaf out-branching problem | 2010-04-28 | Paper |
| Spanning Directed Trees with Many Leaves | 2010-03-17 | Paper |
| FPT algorithms and kernels for the directed \(k\)-leaf problem | 2010-02-12 | Paper |
| Minimum cost homomorphism dichotomy for oriented cycles | 2010-01-18 | Paper |
| Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs | 2010-01-14 | Paper |
| A Probabilistic Approach to Problems Parameterized above or below Tight Bounds | 2010-01-14 | Paper |
| Local Search Heuristics for the Multidimensional Assignment Problem | 2010-01-07 | Paper |
| Properly Coloured Cycles and Paths: Results and Open Problems | 2010-01-07 | Paper |
| Algorithms for generating convex sets in acyclic digraphs | 2009-12-10 | Paper |
| Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs | 2009-11-27 | Paper |
| Minimum leaf out-branching and related problems | 2009-11-04 | Paper |
| On the number of connected convex subgraphs of a connected acyclic digraph | 2009-06-30 | Paper |
| Convex sets in acyclic digraphs | 2009-05-04 | Paper |
| Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems | 2009-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615793 | 2009-03-24 | Paper |
| An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503350 | 2009-01-15 | Paper |
| Digraphs | 2009-01-12 | Paper |
| Fixed-parameter complexity of minimum profile problems | 2008-12-02 | Paper |
| Tolerance-based Algorithms for the Traveling Salesman Problem | 2008-12-01 | Paper |
| Minimum cost homomorphisms to semicomplete multipartite digraphs | 2008-09-29 | Paper |
| Minimum Cost Homomorphism Dichotomy for Oriented Cycles | 2008-07-10 | Paper |
| Minimum Leaf Out-Branching Problems | 2008-07-10 | Paper |
| A problem of finding an acceptable variant in generalized project networks | 2008-07-01 | Paper |
| Fixed-Parameter Complexity of Minimum Profile Problems | 2008-06-03 | Paper |
| A dichotomy for minimum cost graph homomorphisms | 2008-05-13 | Paper |
| Better Algorithms and Bounds for Directed Maximum Leaf Problems | 2008-04-24 | Paper |
| Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems | 2008-02-21 | Paper |
| The linear arrangement problem parameterized above guaranteed value | 2007-12-19 | Paper |
| Parameterized Algorithms for Directed Maximum Leaf Problems | 2007-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755519 | 2007-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755528 | 2007-08-13 | Paper |
| The Linear Arrangement Problem Parameterized Above Guaranteed Value | 2007-05-02 | Paper |
| Characterization of edge-colored complete graphs with properly colored Hamilton paths | 2007-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3415356 | 2007-01-18 | Paper |
| Domination analysis for minimum multiprocessor scheduling | 2007-01-09 | Paper |
| Hamilton cycles in digraphs of unitary matrices | 2006-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5487898 | 2006-09-13 | Paper |
| On \(n\)-partite tournaments with unique \(n\)-cycle | 2006-09-12 | Paper |
| Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs | 2006-06-30 | Paper |
| Level of repair analysis and minimum cost homomorphisms of graphs | 2006-06-09 | Paper |
| Minimum cost and list homomorphisms to semicomplete digraphs | 2006-06-09 | Paper |
| Further extension of the TSP assign neighborhood | 2006-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374248 | 2006-03-09 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| When the greedy algorithm fails | 2005-08-22 | Paper |
| Kernels in planar digraphs | 2005-08-03 | Paper |
| Batched bin packing | 2005-06-01 | Paper |
| When \(n\)-cycles in \(n\)-partite tournaments are longest cycles | 2005-02-22 | Paper |
| Algorithms with large domination ratio | 2004-10-04 | Paper |
| On the number of quasi-kernels in digraphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461908 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461912 | 2004-05-18 | Paper |
| Extracting pure network submatrices in linear programs using signed graphs. | 2004-03-14 | Paper |
| Steiner type problems for digraphs that are locally semicomplete or extended semicomplete | 2004-02-03 | Paper |
| Domination analysis of combinatorial optimization problems. | 2003-09-09 | Paper |
| Upper bounds on ATSP neighborhood size. | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405643 | 2003-06-23 | Paper |
| Almost minimum diameter orientations of semicomplete multipartite and extended digraphs | 2003-03-25 | Paper |
| Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs | 2003-03-02 | Paper |
| Orientations of digraphs almost preserving diameter | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552170 | 2002-08-29 | Paper |
| Anti-matroids | 2002-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539516 | 2002-07-09 | Paper |
| Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number | 2002-06-24 | Paper |
| Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712516 | 2001-11-09 | Paper |
| Exponential neighbourhood local search for the traveling salesman problem | 2001-11-06 | Paper |
| Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour | 2001-09-23 | Paper |
| Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs | 2001-06-04 | Paper |
| Construction heuristics for the asymmetric TSP. | 2001-03-28 | Paper |
| TSP tour domination and Hamilton cycle decompositions of regular digraphs | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4487469 | 2000-12-03 | Paper |
| A note on the cardinality of certain classes of unlabeled multipartite tournaments | 2000-11-02 | Paper |
| Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs | 2000-11-02 | Paper |
| Upper domination and upper irredundance perfect graphs | 2000-11-02 | Paper |
| Note on alternating directed cycles | 2000-11-02 | Paper |
| Detecting embedded networks in LP using GUB structures and independent set algorithms | 2000-10-29 | Paper |
| On the Hajós number of graphs | 2000-09-27 | Paper |
| Kings in semicomplete multipartite digraphs | 2000-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500916 | 2000-08-31 | Paper |
| Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian | 2000-06-25 | Paper |
| On the complexity of hamiltonian path and cycle problems in certain classes of digraphs | 2000-04-09 | Paper |
| Generalizations of tournaments: A survey | 1999-09-10 | Paper |
| A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs | 1999-07-07 | Paper |
| Properly coloured Hamiltonian paths in edge-coloured complete graphs | 1998-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390605 | 1998-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358434 | 1998-03-02 | Paper |
| Hamiltonian paths and cycles in hypertournaments | 1997-12-17 | Paper |
| Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments | 1997-12-01 | Paper |
| Vertex heaviest paths and cycles in quasi-transitive digraphs | 1997-11-25 | Paper |
| Alternating cycles and paths in edge-coloured multigraphs: A survey | 1997-11-25 | Paper |
| Paths and cycles in extended and decomposable digraphs | 1997-10-07 | Paper |
| A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian | 1997-09-17 | Paper |
| Ranking the vertices of a complete multipartite paired comparison digraph | 1997-08-17 | Paper |
| Finding a Longest Path in a Complete Multipartite Digraph | 1997-06-29 | Paper |
| On \(k\)-strong and \(k\)-cyclic digraphs | 1997-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284651 | 1997-06-10 | Paper |
| A classification of locally semicomplete digraphs | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888111 | 1996-11-05 | Paper |
| Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs | 1996-06-18 | Paper |
| Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey | 1996-06-18 | Paper |
| Weakly Hamiltonian-connected ordinary multipartite tournaments | 1996-03-10 | Paper |
| Minimizing and maximizing the diameter in orientations of graphs | 1995-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325297 | 1995-03-08 | Paper |
| Maximizing traveling salesman problem for special matrices | 1995-02-01 | Paper |
| On cycles in multipartite tournaments | 1994-05-24 | Paper |
