Jørgen Bang-Jensen

Florian Hörsch

Theor. Comput. Sci., September, 2023

Making a tournament k $k$-strong.

[BibT_eX]

[DOI]

Kasper Skov Johansen

J. Graph Theory, May, 2023

The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., March, 2023

Spanning eulerian subdigraphs in semicomplete digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2023

Constrained Flows in Networks.

[BibT_eX]

[DOI]

Lucas Picasarri-Arrieta

CoRR, 2023

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.

[BibT_eX]

[DOI]

Pranabendu Misra

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Complexity of some arc-partition problems for digraphs.

[BibT_eX]

[DOI]

Daniel Gonçalves

Lucas Picasarri-Arrieta

Theor. Comput. Sci., 2022

Digraphs and Variable Degeneracy.

[BibT_eX]

[DOI]

Thomas Schweser

Michael Stiebitz

SIAM J. Discret. Math., 2022

Good acyclic orientations of 4-regular 4-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2.

[BibT_eX]

[DOI]

Graphs Comb., 2022

Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked.

[BibT_eX]

[DOI]

Kasper Skov Johansen

Discret. Math., 2022

Component Order Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

Proper-walk connection number of graphs.

[BibT_eX]

[DOI]

Thomas Bellitto

J. Graph Theory, 2021

Good orientations of unions of edge-disjoint spanning trees.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

On Supereulerian 2-Edge-Coloured Graphs.

[BibT_eX]

[DOI]

Thomas Bellitto

Graphs Comb., 2021

On the inversion number of oriented graphs.

[BibT_eX]

[DOI]

Jonas Costa Ferreira da Silva

Discret. Math. Theor. Comput. Sci., 2021

k-Distinct Branchings Admits a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

The directed 2-linkage problem with length constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the parameterized complexity of 2-partitions.

[BibT_eX]

[DOI]

Jonas Bamse Andersen

Theor. Comput. Sci., 2020

Arc-disjoint strong spanning subdigraphs of semicomplete compositions.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

On DP-coloring of digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Out-colourings of digraphs.

[BibT_eX]

[DOI]

Noga Alon

J. Graph Theory, 2020

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments.

[BibT_eX]

[DOI]

Hugues Déprés

Discret. Math., 2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2.

[BibT_eX]

[DOI]

CoRR, 2020

Hajós and Ore Constructions for Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Inversion number of an oriented graph and related parameters.

[BibT_eX]

[DOI]

Jonas Costa Ferreira da Silva

Proceedings of the First International Conference "Algebras, graphs and ordered sets", 2020

2019

The parameterized complexity landscape of finding 2-partitions of digraphs.

[BibT_eX]

[DOI]

Meirav Zehavi

Theor. Comput. Sci., 2019

Degree-constrained 2-partitions of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Bipartite spanning sub(di)graphs induced by 2-partitions.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Safe sets in digraphs.

[BibT_eX]

[DOI]

CoRR, 2019

Connecting edge-colouring.

[BibT_eX]

[DOI]

Thomas Bellitto

CoRR, 2019

2018

Degree constrained 2-partitions of semicomplete digraphs.

[BibT_eX]

[DOI]

Tilde My Christiansen

Theor. Comput. Sci., 2018

Out-degree reducing partitions of digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Completing orientations of partially oriented graphs.

[BibT_eX]

[DOI]

Xuding Zhu

J. Graph Theory, 2018

χ-bounded families of oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

[BibT_eX]

[DOI]

Manu Basavaraju

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Tournaments and Semicomplete Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

Basic Terminology, Notation and Results.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

Locally Semicomplete Digraphs and Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

2017

Disjoint Paths in Decomposable Digraphs.

[BibT_eX]

[DOI]

Tilde My Christiansen

J. Graph Theory, 2017

Antistrong digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2017

2016

Finding good 2-partitions of digraphs I. Hereditary properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Finding good 2-partitions of digraphs II. Enumerable properties.

[BibT_eX]

[DOI]

Nathann Cohen

Theor. Comput. Sci., 2016

DAG-Width and Circumference of Digraphs.

[BibT_eX]

[DOI]

Tilde My Larsen

J. Graph Theory, 2016

Arc-Disjoint Directed and Undirected Cycles in Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

The complexity of finding arc-disjoint branching flows.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs.

[BibT_eX]

[DOI]

Sven Simonsen

Algorithmica, 2016

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Balanced branchings in digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Finding a subdivision of a digraph.

[BibT_eX]

[DOI]

Ana Karolinna Maia

Theor. Comput. Sci., 2015

Sufficient Conditions for a Digraph to be Supereulerian.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Vertex coloring edge-weighted digraphs.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Inf. Process. Lett., 2015

Restricted cycle factors and arc-decompositions of digraphs.

[BibT_eX]

[DOI]

Carl Johan Casselgren

Discret. Appl. Math., 2015

2014

The complexity of multicut and mixed multicut problems in (di)graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

(Arc-)disjoint flows in networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Arc-Disjoint Paths in Decomposable Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments.

[BibT_eX]

[DOI]

Stéphan Thomassé

J. Graph Theory, 2014

Vertex-disjoint directed and undirected cycles in general digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2014

2013

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.

[BibT_eX]

[DOI]

Daniel Gonçalves

Theor. Comput. Sci., 2013

Arc-disjoint paths and trees in 2-regular digraphs.

[BibT_eX]

[DOI]

Sven Simonsen

Discret. Appl. Math., 2013

Quasi-hamiltonian paths in semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

Sven Simonsen

Discret. Appl. Math., 2013

2012

Arc-disjoint spanning sub(di)graphs in digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Decomposing locally semicomplete digraphs into strong spanning subdigraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2012

Efficient algorithms for real-life instances of the variable size bin packing problem.

[BibT_eX]

[DOI]

Rune Larsen

Comput. Oper. Res., 2012

2011

Finding an induced subdivision of a digraph.

[BibT_eX]

[DOI]

Nicolas Trotignon

Electron. Notes Discret. Math., 2011

On the problem of finding disjoint cycles and dicycles in a digraph.

[BibT_eX]

[DOI]

Comb., 2011

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles.

[BibT_eX]

[DOI]

Jacobus Swarts

Contributions Discret. Math., 2011

2010

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation.

[BibT_eX]

[DOI]

Marco Chiarandini

Peter Morling

Networks, 2010

Heuristics for the central tree problem.

[BibT_eX]

[DOI]

Yury Nikulin

J. Heuristics, 2010

The complexity of colouring by locally semicomplete digraphs.

[BibT_eX]

[DOI]

Jacobus Swarts

Discret. Math., 2010

Spanning 2-strong tournaments in 3-strong semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Disjoint directed and undirected paths and cycles in digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Disjoint sub(di)graphs in digraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

k-strong spanning local tournaments in locally semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Digraphs - Theory, Algorithms and Applications, Second Edition.

[BibT_eX]

Springer Monographs in Mathematics, Springer, ISBN: 978-1-84800-997-4, 2009

2008

On persistent directed graphs.

[BibT_eX]

[DOI]

Networks, 2008

Minimum cycle factors in quasi-transitive digraphs.

[BibT_eX]

[DOI]

Morten Hegner Nielsen

Discret. Optim., 2008

The minimum spanning strong subdigraph problem is fixed parameter tractable.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.

[BibT_eX]

[DOI]

Daniel Gonçalves

Inge Li Gørtz

Discret. Optim., 2007

Recognizing and representing proper interval graphs in parallel using merging and sorting.

[BibT_eX]

[DOI]

Louis Ibarra

Discret. Appl. Math., 2007

Mixed Models for the Analysis of Local Search Components.

[BibT_eX]

[DOI]

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

2006

Longest path partitions in generalizations of tournaments.

[BibT_eX]

[DOI]

Morten Hegner Nielsen

Discret. Math., 2006

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Optim., 2006

2005

Finding complementary cycles in locally semicomplete digraphs.

[BibT_eX]

[DOI]

Morten Hegner Nielsen

Discret. Appl. Math., 2005

2004

Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Subgraphs in vertex neighborhoods of Kr-free graphs.

[BibT_eX]

[DOI]

Stephan Brandt

J. Graph Theory, 2004

Splitting off edges between two subsets preserving the edge-connectivity of the graph.

[BibT_eX]

[DOI]

Discret. Math., 2004

The structure of strong arc-locally semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

When the greedy algorithm fails.

[BibT_eX]

[DOI]

Discret. Optim., 2004

Making a tournament k-arc-strong by reversing or deorienting arcs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.

[BibT_eX]

[DOI]

Comb., 2004

2003

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Small degree out-branchings.

[BibT_eX]

[DOI]

Stéphan Thomassé

J. Graph Theory, 2003

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs.

[BibT_eX]

[DOI]

Stéphan Thomassé

Discret. Appl. Math., 2003

2002

Convex-round graphs are circular-perfect.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Digraphs - theory, algorithms and applications.

[BibT_eX]

Springer, ISBN: 978-1-85233-611-0, 2002

2001

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Making a tournament k-arc-strong by reversing arcs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

Convex-Round and Concave-Round Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Problems concerning global connectivity of directed graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Complementary cycles containing prescribed vertices in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Edge-Connectivity Augmentation with Partition Constraints.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Augmenting hypergraphs by edges of size two.

[BibT_eX]

[DOI]

Bill Jackson

Math. Program., 1999

A note on vertex pancyclic oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Linkages in locally semicomplete digraphs and quasi-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

A New Sufficient Condition for a Digraph to Be Hamiltonian.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Edge-Connectivity Augmentation Preserving Simplicity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Generalizations of tournaments: A survey.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Kings in quasi-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Alternating cycles and trails in 2-edge-coloured complete multigraphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Adding and Reversing Arcs in Semicomplete Digraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

1997

A classification of locally semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Alternating cycles and paths in edge-coloured multigraphs: A survey.

[BibT_eX]

[DOI]

Discret. Math., 1997

Paths and cycles in extended and decomposable digraphs, .

[BibT_eX]

[DOI]

Discret. Math., 1997

Vertex heaviest paths and cycles in quasi-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.

[BibT_eX]

[DOI]

Algorithmica, 1997

1996

Weakly Hamiltonian-connected locally semicomplete digraphs.

[BibT_eX]

[DOI]

Lutz Volkmann

J. Graph Theory, 1996

Sufficient conditions for a digraph to be Hamiltonian.

[BibT_eX]

[DOI]

Hao Li

J. Graph Theory, 1996

On k-strong and k-cyclic digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs.

[BibT_eX]

[DOI]

András Frank

Bill Jackson

SIAM J. Discret. Math., 1995

Quasi-transitive digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Digraphs with the path-merging property.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.

[BibT_eX]

[DOI]

Yannis Manoussakis

J. Comb. Theory, Ser. B, 1995

Hereditarily hard H-colouring problems.

[BibT_eX]

[DOI]

Discret. Math., 1995

Weakly Hamiltonian-connected ordinary multipartite tournaments.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

On chordal proper circular arc graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Cycles Through k Vertices in Bipartite Tournaments.

[BibT_eX]

[DOI]

Yannis Manoussakis

Comb., 1994

1993

In-Tournament Digraphs.

[BibT_eX]

[DOI]

Erich Prisner

J. Comb. Theory, Ser. B, 1993

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs.

[BibT_eX]

[DOI]

Carsten Thomassen

SIAM J. Discret. Math., 1992

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.

[BibT_eX]

[DOI]

Yannis Manoussakis

Carsten Thomassen

J. Algorithms, 1992

Unsolved problems presented at the Julius Petersen Graph Theory Conference.

[BibT_eX]

[DOI]

Bjarne Toft

Discret. Math., 1992

On the complexity of colouring by superdigraphs of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

On the structure of locally semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Edge-disjoint in- and out-branchings in tournaments and related path problems.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1991

Eulerian trails through a set of terminals in specific, unique and all orders.

[BibT_eX]

Svatopluk Poljak

Proceedings of the Graph Structure Theory, 1991

1990

Locally semicomplete digraphs: A generalization of tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

The effect of two cycles on the complexity of colourings by directed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

Local Tournaments and Proper Circular Arc Gaphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1990

1988

The Complexity of Colouring by Semicomplete Digraphs.

[BibT_eX]

[DOI]