Publications of Jorgen Bang-Jensen
BACK TO COATI PUBLICATION INDEX
Publications of Jorgen Bang-Jensen
-
Jorgen Bang-Jensen,
Stéphane Bessy,
Frédéric Havet,
and Anders Yeo.
Bipartite spanning sub(di)graphs induced by 2-partitions.
Journal of Graph Theory,
92(2):130-151,
October 2019.
[WWW
] [PDF
]
Keywords:
Eulerian,
Spanning bipartite subdigraph,
Strong spanning subdigraph,
2-partition,
Minimum out-degree.
[bibtex-entry]
-
P. Aboulker,
J. Bang-Jensen,
Nicolas Bousquet,
Pierre Charbit,
Frédéric Havet,
F. Maffray,
and J. Zamora.
$$\chi$$-bounded families of oriented graphs.
Journal of Graph Theory,
89(3):304 - 326,
September 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Joergen Bang-Jensen,
Stéphane Bessy,
Frédéric Havet,
and Anders Yeo.
Out-degree reducing partitions of digraphs.
Theoretical Computer Science,
719:64-72,
April 2018.
[WWW
] [PDF
]
Keywords:
Polynomial algorithm,
2-partition,
Maximum out-degree reducing partition,
NP-complete.
[bibtex-entry]
-
Frédéric Havet and Joergen Bang-Jensen.
Tournaments and Semicomplete Digraphs..
In Classes of Directed Graphs.
2018.
[WWW
] [bibtex-entry]
-
Joergen Bang-Jensen,
Nathann Cohen,
and Frédéric Havet.
Finding good 2-partitions of digraphs II. Enumerable properties.
Journal of Theoretical Computer Science (TCS),
640:1-19,
August 2016.
[WWW
] [PDF
]
Keywords:
Feedback vertex set,
Out-branching,
Tournament,
Oriented,
NP-complete,
Polynomial,
Partition,
Splitting digraphs,
Acyclic,
Semicomplete digraph,
2-Partition,
Minimum degree.
[bibtex-entry]
-
J Bang-Jensen,
Frédéric Havet,
and Anders Yeo.
The complexity of finding arc-disjoint branching flows.
Discrete Applied Mathematics,
209:16-26,
2016.
[WWW
] [PDF
] [bibtex-entry]
-
J Bang-Jensen and Frédéric Havet.
Finding good 2-partitions of digraphs I. Hereditary properties.
Journal of Theoretical Computer Science (TCS),
636:85--94,
2016.
[WWW
] [PDF
]
Keywords:
minimum degree,
2-partition,
tournament,
out-branching,
feedback vertex set,
oriented,
NP-complete,
polynomial,
partition,
splitting digraphs,
acyclic,
semicomplete digraph.
[bibtex-entry]
-
Jorgen Bang-Jensen,
Frédéric Havet,
and Ana Karolinna MAIA DE OLIVEIRA.
Finding a subdivision of a digraph.
Theoretical Computer Science,
562:20,
2015.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and N. Trotignon.
Finding an induced subdivision of a digraph.
Theoretical Computer Science,
443:10-24,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Bang-Jensen,
B. Reed,
M. Schacht,
R. Sámal,
B. Toft,
and U. Wagner.
Topics in Discrete Mathematics, Dedicated to Jarik Nesetril on the Occasion of his 60th birthday,
volume 26 of Algorithms and Combinatorics,
chapter On six problems posed by Jarik Nesetril,
pages 613--627.
Springer,
Berlin,
M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas and P. Valtr edition,
2006.
[bibtex-entry]
-
Jorgen Bang-Jensen,
Jonas Costa Ferreira Da Silva,
and Frédéric Havet.
Inversion number of an oriented graph and related parameters.
In ALGOS 2020 - 1st International Conference on Algebras, Graphs and Ordered Sets,
Nancy / Virtual, France,
August 2020.
[WWW
] [PDF
]
Keywords:
Feedback vertex set,
Feedback arc set,
Inversion,
Tournament,
Oriented graph,
Intercyclic digraph.
[bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and N. Trotignon.
Finding an induced subdivision of a digraph.
In VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011),
volume 37,
Bariloche, Argentina,
pages 09-14,
04 2011.
[Abstract] [bibtex-entry]
-
Frédéric Havet,
Jorgen Bang-Jensen,
and Anders Yeo.
Spanning eulerian subdigraphs in semicomplete digraphs.
Research Report,
Inria ; CNRS ; I3S ; Université côte d'azur,
December 2021.
[WWW
] [PDF
]
Keywords:
Arc-connectivity,
Eulerian subdigraph,
Tournament,
Semicomplete digraph,
polynomial algorithm.
[bibtex-entry]
-
Jorgen Bang-Jensen,
Nathann Cohen,
and Frédéric Havet.
Finding good 2-partitions of digraphs II. Enumerable properties.
Research Report RR-8868,
INRIA Sophia Antipolis - I3S,
February 2016.
[WWW
] [PDF
] [bibtex-entry]
-
Jorgen Bang-Jensen and Frédéric Havet.
Finding good 2-partitions of digraphs I. Hereditary properties.
Research Report RR-8867,
INRIA Sophia Antipolis - I3S,
February 2016.
[WWW
] [PDF
] [bibtex-entry]
-
Joergen Bang-Jensen,
Frédéric Havet,
and Anders Yeo.
The complexity of finding arc-disjoint branching flows.
Research Report RR-8640,
INRIA Sophia Antipolis ; INRIA,
November 2014.
[WWW
] [PDF
]
Keywords:
disjoint branchings,
branching flow,
polynomial algorithm,
NP-complete.
[bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and A. K. Maia.
Finding a subdivision of a digraph.
Technical report RR-8024,
INRIA,
July 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and N. Trotignon.
Finding an induced subdivision of a digraph.
Research Report 7430,
INRIA,
10 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
Pierre Aboulker,
Jorgen Bang-Jensen,
Nicolas Bousquet,
Pierre Charbit,
Frédéric Havet,
Frédéric Maffray,
and Jose Zamora.
$\chi$-bounded families of oriented graphs.
Note: Working paper or preprint,
2016.
[WWW
] [PDF
] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:43 2022
