Joergen Bang-Jensen

Joergen Bang-Jensen

Syddansk Universitet

H-index: 31

Europe-Denmark

About Joergen Bang-Jensen

Joergen Bang-Jensen, With an exceptional h-index of 31 and a recent h-index of 15 (since 2020), a distinguished researcher at Syddansk Universitet, specializes in the field of graph theory, discrete optimization.

His recent articles reflect a diverse array of research interests and contributions to the field:

Safe sets and in-dominating sets in digraphs

Generalized paths and cycles in semicomplete multipartite digraphs

Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations

Arc-disjoint out-and in-branchings in compositions of digraphs

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

Strong arc decompositions of split digraphs

Making a tournament k k‐strong

Joergen Bang-Jensen Information

University

Position

professor of discrete optimization

Citations(all)

7290

Citations(since 2020)

2166

Cited By

6020

hIndex(all)

31

hIndex(since 2020)

15

i10Index(all)

91

i10Index(since 2020)

28

Email

University Profile Page

Syddansk Universitet

Google Scholar

View Google Scholar Profile

Joergen Bang-Jensen Skills & Research Interests

graph theory

discrete optimization

Top articles of Joergen Bang-Jensen

Title

Journal

Author(s)

Publication Date

Safe sets and in-dominating sets in digraphs

Discrete Applied Mathematics

Yandong Bai

Jørgen Bang-Jensen

Shinya Fujita

Hirotaka Ono

Anders Yeo

2024/3/31

Generalized paths and cycles in semicomplete multipartite digraphs

arXiv preprint arXiv:2403.07597

Jørgen Bang-Jensen

Yun Wang

Anders Yeo

2024/3/12

Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs

Journal of Graph Theory

Joergen Bang‐Jensen

Yun Wang

2024/1/3

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations

Theoretical Computer Science

Jørgen Bang-Jensen

Florian Hörsch

Matthias Kriesell

2023/9/21

Arc-disjoint out-and in-branchings in compositions of digraphs

arXiv preprint arXiv:2302.08283

Joergen Bang-Jensen

Yun Wang

2023/2/16

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

Jørgen Bang-Jensen

Kristine Vitting Klinkby

Pranabendu Misra

Saket Saurabh

2023

Strong arc decompositions of split digraphs

arXiv preprint arXiv:2309.06904

Joergen Bang-Jensen

Yun Wang

2023/9/13

Making a tournament k k‐strong

Journal of Graph Theory

Jørgen Bang‐Jensen

Kasper S Johansen

Anders Yeo

2023/5

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

Theoretical Computer Science

Jørgen Bang-Jensen

Anders Yeo

2023/3/9

Spanning eulerian subdigraphs in semicomplete digraphs

Journal of Graph Theory

Jørgen Bang‐Jensen

Frédéric Havet

Anders Yeo

2023/3

Constrained Flows in Networks

arXiv preprint arXiv:2310.01042

Stéphane Bessy

Jørgen Bang-Jensen

Lucas Picasarri-Arrieta

2023/10/2

Digraphs and variable degeneracy

SIAM Journal on Discrete Mathematics

Jørgen Bang-Jensen

Thomas Schweser

Michael Stiebitz

2022

Component order connectivity in directed graphs

Algorithmica

Jørgen Bang-Jensen

Eduard Eiben

Gregory Gutin

Magnus Wahlström

Anders Yeo

2022/9

Good acyclic orientations of 4‐regular 4‐connected graphs

Journal of Graph Theory

Jørgen Bang‐Jensen

Matthias Kriesell

2022/8

On the inversion number of oriented graphs

Discrete Mathematics & Theoretical Computer Science

Jørgen Bang-Jensen

Jonas Costa Ferreira da Silva

Frédéric Havet

2022/12/21

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

Discrete Mathematics

Jørgen Bang-Jensen

Kasper Skov Johansen

2022/6/1

Non-separating spanning trees and out-branchings in digraphs of independence number 2

Graphs and Combinatorics

Jørgen Bang-Jensen

Stéphane Bessy

Anders Yeo

2022/12

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

Journal of Graph Theory

Jørgen Bang‐Jensen

Stéphane Bessy

Frédéric Havet

Anders Yeo

2022/6

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

Journal of Graph Theory

Jørgen Bang‐Jensen

Frédéric Havet

Matthias Kriesell

Anders Yeo

2022/4

Complexity of some arc-partition problems for digraphs

Theoretical Computer Science

Jørgen Bang-Jensen

Stéphane Bessy

Daniel Gonçalves

Lucas Picasarri-Arrieta

2022/9/3

See List of Professors in Joergen Bang-Jensen University(Syddansk Universitet)

Co-Authors

H-index: 63
Carsten Thomassen

Carsten Thomassen

Danmarks Tekniske Universitet

H-index: 50
Pavol Hell

Pavol Hell

Simon Fraser University

H-index: 42
András Frank

András Frank

Eötvös Loránd Tudományegyetem

H-index: 42
G. Gutin

G. Gutin

Royal Holloway, University of London

H-index: 39
Anders Yeo

Anders Yeo

Syddansk Universitet

H-index: 33
Bill Jackson

Bill Jackson

Queen Mary University of London

academic-engine