| Publication | Date of Publication | Type |
|---|
| Finding all stable matchings with assignment constraints | 2025-01-17 | Paper |
| Transversal coalitions in hypergraphs | 2024-12-02 | Paper |
| Bounds on maximum weight directed cut | 2024-09-17 | Paper |
| Note on disjoint cycles in multipartite tournaments | 2024-07-10 | Paper |
| Safe sets and in-dominating sets in digraphs | 2024-02-14 | Paper |
| On Seymour's and Sullivan's second neighbourhood conjectures | 2024-01-30 | Paper |
| Transversals in regular uniform hypergraphs | 2024-01-30 | Paper |
| Subeulerian oriented graphs | 2024-01-16 | Paper |
| Note on Disjoint Cycles in Multipartite Tournaments | 2023-11-22 | Paper |
| Component order connectivity in directed graphs | 2023-11-13 | Paper |
| Making a tournament k $k$‐strong | 2023-10-09 | Paper |
| Spanning eulerian subdigraphs in semicomplete digraphs | 2023-10-06 | Paper |
| Perfect forests in graphs and their extensions | 2023-10-05 | Paper |
| Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 | 2023-10-05 | Paper |
| A complete description of convex sets associated with matchings and edge‐connectivity in graphs | 2023-10-05 | Paper |
| Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties | 2023-10-05 | Paper |
| Proper‐walk connection number of graphs | 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 |
| The Tuza–Vestergaard Theorem | 2023-06-27 | Paper |
| Lower Bounds for Maximum Weighted Cut | 2023-06-22 | Paper |
| Results on the small quasi-kernel conjecture | 2023-05-15 | Paper |
| Bounds on Maximum Weight Directed Cut | 2023-04-20 | Paper |
| Preference swaps for the stable matching problem | 2023-04-20 | Paper |
| Exact capacitated domination: on the computational complexity of uniqueness | 2023-04-17 | Paper |
| Non-separating spanning trees and out-branchings in digraphs of independence number 2 | 2022-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104251 | 2022-09-09 | Paper |
| Component order connectivity in directed graphs | 2022-08-18 | Paper |
| Arc‐disjoint strong spanning subdigraphs of semicomplete compositions | 2022-03-31 | Paper |
| Preference Swaps for the Stable Matching Problem | 2021-12-31 | Paper |
| Domination and Total Domination in Hypergraphs | 2021-12-14 | Paper |
| On supereulerian 2-edge-coloured graphs | 2021-11-30 | Paper |
| Lower bounds on Tuza constants for transversals in linear uniform hypergraphs | 2021-09-30 | Paper |
| Affine planes and transversals in 3-uniform linear hypergraphs | 2021-08-12 | Paper |
| A new upper bound on the total domination number in graphs with minimum degree six | 2021-08-02 | Paper |
| Transversals in Uniform Linear Hypergraphs | 2021-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993600 | 2021-06-15 | Paper |
| Matching and edge-connectivity in graphs with given maximum degree | 2021-06-14 | Paper |
| Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games | 2021-04-21 | Paper |
| Dominating vertex covers: the vertex-edge domination problem | 2020-12-08 | Paper |
| Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments | 2020-10-08 | Paper |
| Transversals in linear uniform hypergraphs | 2020-06-23 | Paper |
| Exact capacitated domination: on the computational complexity of uniqueness | 2020-03-16 | Paper |
| The directed 2-linkage problem with length constraints | 2020-03-12 | Paper |
| Bounds on upper transversals in hypergraphs | 2020-02-03 | Paper |
| Bipartite spanning sub(di)graphs induced by 2‐partitions | 2019-10-31 | Paper |
| Safe sets in digraphs | 2019-08-19 | Paper |
| Proper-walk connection number of graphs | 2019-06-30 | Paper |
| Upper transversals in hypergraphs | 2019-06-18 | Paper |
| Semicomplete Multipartite Digraphs | 2019-03-04 | Paper |
| On upper transversals in 3-uniform hypergraphs | 2018-11-22 | Paper |
| Tight lower bounds on the matching number in a graph with given maximum degree | 2018-10-31 | Paper |
| Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs | 2018-06-07 | Paper |
| Out-degree reducing partitions of digraphs | 2018-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4604341 | 2018-02-23 | Paper |
| Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems | 2017-11-17 | Paper |
| Note on maximal bisection above tight lower bound | 2017-11-03 | Paper |
| A note on fractional disjoint transversals in hypergraphs | 2017-08-01 | Paper |
| Transversals and independence in linear hypergraphs with maximum degree two | 2017-07-13 | Paper |
| Note on Perfect Forests in Digraphs | 2017-07-05 | Paper |
| Matching critical intersection hypergraphs | 2017-03-20 | Paper |
| Transversals in 4-uniform hypergraphs | 2016-12-06 | Paper |
| Every 4-regular 4-uniform hypergraph has a 2-coloring with a free vertex | 2016-11-27 | Paper |
| Rural postman parameterized by the number of components of required edges | 2016-09-16 | Paper |
| Making a tournament \(k\)-arc-strong by reversing arcs | 2016-07-01 | Paper |
| The complexity of finding arc-disjoint branching flows | 2016-06-21 | Paper |
| Edge domination in grids | 2016-05-30 | Paper |
| Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths | 2016-04-06 | Paper |
| Parameterizations of test cover with bounded test sizes | 2016-03-23 | Paper |
| Independence in 5-uniform hypergraphs | 2015-12-08 | Paper |
| On 2-Colorings of Hypergraphs | 2015-09-29 | Paper |
| Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey | 2015-09-28 | Paper |
| Balanced branchings in digraphs | 2015-07-24 | Paper |
| Total Transversals in Hypergraphs and Their Applications | 2015-05-20 | Paper |
| Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs | 2014-09-19 | Paper |
| A new lower bound on the independence number of a graph and applications | 2014-09-04 | Paper |
| Total transversals and total domination in uniform hypergraphs | 2014-09-04 | Paper |
| A maximum degree theorem for diameter-2-critical graphs | 2014-08-29 | Paper |
| The domination number of a random graph | 2014-08-28 | Paper |
| A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture | 2014-08-22 | Paper |
| 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs | 2014-07-29 | Paper |
| On the Meyniel condition for hamiltonicity in bipartite digraphs | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417644 | 2014-05-22 | Paper |
| Total domination in graphs with diameter 2 | 2014-01-28 | Paper |
| Relating the annihilation number and the 2-domination number of a tree | 2014-01-27 | Paper |
| A new bound for 3-satisfiable MaxSat and its algorithmic application | 2014-01-16 | Paper |
| Parameterized complexity of \(k\)-Chinese postman problem | 2014-01-13 | Paper |
| The complexity of multicut and mixed multicut problems in (di)graphs | 2014-01-13 | Paper |
| Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value | 2013-12-02 | Paper |
| Fixed-Parameter Tractability of Satisfying beyond the Number of Variables | 2013-08-12 | Paper |
| Identifying vertex covers in graphs | 2013-06-07 | Paper |
| Hypergraphs with large transversal number | 2013-04-15 | Paper |
| Total Domination in Graphs | 2013-04-04 | Paper |
| (Non-)existence of polynomial kernels for the test cover problem | 2013-03-20 | Paper |
| Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three | 2013-03-07 | Paper |
| Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties | 2013-03-04 | Paper |
| Total domination and matching numbers in graphs with all vertices in triangles | 2013-01-03 | Paper |
| Girth and total domination in graphs | 2012-12-27 | Paper |
| Transversals and matchings in 3-uniform hypergraphs | 2012-12-03 | 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 |
| Parameterized Study of the Test Cover Problem | 2012-09-25 | Paper |
| An algorithm for finding input-output constrained convex sets in an acyclic digraph | 2012-09-13 | Paper |
| Vertex disjoint cycles of different length in digraphs | 2012-09-12 | Paper |
| Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey | 2012-09-05 | Paper |
| Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average | 2012-08-31 | Paper |
| Arc-disjoint spanning sub(di)graphs in digraphs | 2012-08-08 | Paper |
| Parameterized Eulerian strong component arc deletion problem on tournaments | 2012-07-18 | Paper |
| Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables | 2012-05-11 | Paper |
| A POLYNOMIAL KERNEL FOR MULTICUT IN TREES | 2012-04-24 | Paper |
| A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free | 2012-03-07 | Paper |
| Perfect matchings in total domination critical graphs | 2012-01-24 | Paper |
| On a conjecture of Murty and Simon on diameter two critical graphs. II. | 2012-01-11 | Paper |
| Solving MAX-\(r\)-SAT above a tight lower bound | 2011-11-07 | Paper |
| Kernel bounds for disjoint cycles and disjoint paths | 2011-09-12 | Paper |
| On a conjecture of Murty and Simon on diameter 2-critical graphs | 2011-08-09 | Paper |
| Strong transversals in hypergraphs and double total domination in graphs | 2011-07-18 | Paper |
| On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs | 2011-05-31 | Paper |
| A kernel of order \(2k - c\) for Vertex Cover | 2011-05-10 | Paper |
| A probabilistic approach to problems parameterized above or below tight bounds | 2011-03-28 | Paper |
| A new bound on the domination number of graphs with minimum degree two | 2011-02-17 | 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 |
| All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables | 2010-09-06 | 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 |
| A probabilistic approach to problems parameterized above or below tight bounds | 2010-01-14 | Paper |
| Algorithms for generating convex sets in acyclic digraphs | 2009-12-10 | Paper |
| Total domination in partitioned graphs | 2009-12-09 | Paper |
| Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs | 2009-11-27 | Paper |
| Kernel Bounds for Disjoint Cycles and Disjoint Paths | 2009-10-29 | Paper |
| Some complexity problems on single input double output controllers | 2009-06-30 | Paper |
| On the number of connected convex subgraphs of a connected acyclic digraph | 2009-06-30 | Paper |
| Total domination in graphs with given girth | 2009-04-29 | Paper |
| A new upper bound on the total domination number of a graph | 2009-04-07 | Paper |
| The minimum spanning strong subdigraph problem is fixed parameter tractable | 2009-03-09 | Paper |
| Hypergraphs with large transversal number and with edge sizes at least 3 | 2009-02-20 | Paper |
| Total domination in 2-connected graphs and in graphs with no induced 6-cycles | 2009-02-20 | Paper |
| An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph | 2009-01-20 | Paper |
| Fixed-parameter complexity of minimum profile problems | 2008-12-02 | Paper |
| Total domination of graphs and small transversals of hypergraphs | 2008-10-21 | Paper |
| Minimum cost homomorphisms to semicomplete multipartite digraphs | 2008-09-29 | Paper |
| Hoàng-Reed conjecture holds for tournaments | 2008-07-11 | Paper |
| Minimum Cost Homomorphism Dichotomy for Oriented Cycles | 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 |
| On matching and total domination in graphs | 2008-04-28 | Paper |
| A Transition from Total Domination in Graphs to Transversals in Hypergraphs | 2008-04-08 | Paper |
| Tight lower bounds on the size of a maximum matching in a regular graph | 2008-03-14 | Paper |
| The linear arrangement problem parameterized above guaranteed value | 2007-12-19 | Paper |
| Paths and cycles containing given arcs, in close to regular multipartite tournaments | 2007-10-10 | Paper |
| On-line bin packing with two item sizes | 2007-08-13 | Paper |
| The greedy algorithm for the symmetric TSP | 2007-08-13 | Paper |
| Relationships between total domination, order, size, and maximum degree of graphs | 2007-08-09 | Paper |
| The Linear Arrangement Problem Parameterized Above Guaranteed Value | 2007-05-02 | Paper |
| The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments | 2007-03-20 | Paper |
| Note on upper bounds for TSP domination number | 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 |
| Longest path partitions in generalizations of tournaments | 2006-09-14 | Paper |
| On \(n\)-partite tournaments with unique \(n\)-cycle | 2006-09-12 | Paper |
| Total domination and matching numbers in claw-free graphs | 2006-08-30 | Paper |
| Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs | 2006-06-30 | Paper |
| Minimum cost and list homomorphisms to semicomplete digraphs | 2006-06-09 | Paper |
| Level of repair analysis and minimum cost homomorphisms of graphs | 2006-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374248 | 2006-03-09 | Paper |
| The number of pancyclic arcs in a k‐strong tournament | 2005-12-08 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5702653 | 2005-11-02 | Paper |
| When the greedy algorithm fails | 2005-08-22 | Paper |
| Kernels in planar digraphs | 2005-08-03 | Paper |
| Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs | 2005-07-05 | Paper |
| Batched bin packing | 2005-06-01 | Paper |
| Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments | 2004-08-16 | Paper |
| On the number of quasi-kernels in digraphs | 2004-08-06 | Paper |
| Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461908 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461912 | 2004-05-18 | Paper |
| Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. | 2004-03-14 | Paper |
| Steiner type problems for digraphs that are locally semicomplete or extended semicomplete | 2004-02-03 | Paper |
| Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs | 2004-01-08 | Paper |
| Packing paths in digraphs | 2003-10-29 | 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 |
| Small degree out‐branchings | 2003-05-11 | 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 |
| Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic | 2002-09-25 | Paper |
| Orientations of digraphs almost preserving diameter | 2002-08-29 | Paper |
| Pushing vertices in digraphs without long induced cycles | 2002-08-29 | Paper |
| Anti-matroids | 2002-08-28 | Paper |
| The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs | 2002-08-01 | 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 |
| Remarks on Hamiltonian digraphs | 2001-11-09 | 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 |
| Note on alternating directed cycles | 2000-11-02 | Paper |
| A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph | 2000-10-17 | Paper |
| Kings in semicomplete multipartite digraphs | 2000-09-24 | Paper |
| Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian | 2000-09-05 | Paper |
| Convex-Round and Concave-Round Graphs | 2000-07-20 | Paper |
| How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? | 2000-07-05 | Paper |
| Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian | 2000-06-25 | Paper |
| Complementary cycles containing prescribed vertices in tournaments | 2000-06-22 | Paper |
| A new sufficient condition for a digraph to be Hamiltonian | 2000-04-09 | Paper |
| Diregularc-partite tournaments are vertex-pancyclic whenc ? 5 | 2000-02-16 | Paper |
| Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments | 2000-01-11 | 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 |
| Maximal and minimal vertex-critical graphs of diameter two | 1998-09-10 | Paper |
| Hamiltonian paths and cycles in hypertournaments | 1997-12-17 | Paper |
| Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments | 1997-12-01 | Paper |
| A note on alternating cycles in edge-coloured graphs | 1997-09-15 | Paper |
| Ranking the vertices of a complete multipartite paired comparison digraph | 1997-08-17 | Paper |
| One-diregular subgraphs in semicomplete multipartite digraphs | 1997-06-29 | Paper |
| On \(k\)-strong and \(k\)-cyclic digraphs | 1997-06-10 | Paper |
| Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees | N/A | Paper |
| Generalized paths and cycles in semicomplete multipartite digraphs | N/A | Paper |
