Joergen Bang-Jensen 个人学术档案

引用次数

	总计	2019 年至今
引用	7463	2329
h 指数	31	17
i10 指数	91	29

480

240

120

360

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202430 33 81 137 82 66 113 78 64 69 113 115 93 153 262 289 267 288 252 287 353 299 291 343 360 470 369 355 444 447 443 266

开放获取的出版物数量

查看全部

47 篇文章

6 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

G. GutinProfessor of Computer Science, Royal Holloway, University of London在 rhul.ac.uk 的电子邮件经过验证
Anders YeoUniversity of Southern Denmark在 imada.sdu.dk 的电子邮件经过验证
Stéphane Bessy在 lirmm.fr 的电子邮件经过验证
Tibor JordánProfessor of mathematics, Eötvös University, Budapest在 math.elte.hu 的电子邮件经过验证
Pavol HellSchool of Computing Science, Simon Fraser University在 sfu.ca 的电子邮件经过验证
Alessandro MaddaloniTélécom SudParis, Institut Mines-Télécom在 telecom-sudparis.eu 的电子邮件经过验证
Bill JacksonQueen Mary, University of London在 qmul.ac.uk 的电子邮件经过验证
Stéphan ThomasséÉcole Normale Supérieure de Lyon在 ens-lyon.fr 的电子邮件经过验证
Carsten ThomassenTechnical University of Denmark在 dtu.dk 的电子邮件经过验证
Saket SaurabhProfessor at Institute of Mathematical Sciences在 imsc.res.in 的电子邮件经过验证
Bjarne ToftSyddansk Universitet在 imada.sdu.dk 的电子邮件经过验证
Marco ChiarandiniUniversity of Southern Denmark在 imada.sdu.dk 的电子邮件经过验证
Jing Huang (黄靖）University of Victoria在 uvic.ca 的电子邮件经过验证
Thomas Schweser在 freenet.de 的电子邮件经过验证
András FrankProfessor emeritus, Eötvös University Budapest在 cs.elte.hu 的电子邮件经过验证
Erich PrisnerProfessor of Mathematics, Franklin University Switzerland在 fus.edu 的电子邮件经过验证
Nicolas Trotignon在 ens-lyon.fr 的电子邮件经过验证
Robert Samalassociate professor, Computer Science Institute, Charles University在 iuuk.mff.cuni.cz 的电子邮件经过验证
Zoltán SzigetiLaboratoire G-SCOP在 grenoble-inp.fr 的电子邮件经过验证
hao liLaboratoire de recherche en informatique, Université Paris-Sud在 lri.fr 的电子邮件经过验证

关注

Joergen Bang-Jensen

professor of discrete optimization, University of Southern Denmark

在 imada.sdu.dk 的电子邮件经过验证 - 首页

graph theory discrete optimization


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Digraphs: theory, algorithms and applications J Bang-Jensen, GZ Gutin Springer Science & Business Media, 2008	3737	2008
When the greedy algorithm fails J Bang-Jensen, G Gutin, A Yeo Discrete optimization 1 (2), 121-127, 2004	218	2004
Locally semicomplete digraphs: a generalization of tournaments J Bang‐Jensen Journal of Graph Theory 14 (3), 371-390, 1990	162	1990
Classes of directed graphs J Bang-Jensen, G Gutin Springer, 2018	157	2018
Quasi‐transitive digraphs J Bang‐Jensen, J Huang Journal of Graph Theory 20 (2), 141-161, 1995	131	1995
The complexity of colouring by semicomplete digraphs J Bang-Jensen, P Hell, G MacGillivray SIAM Journal on Discrete Mathematics 1 (3), 281-298, 1988	119	1988
Alternating cycles and paths in edge-coloured multigraphs: a survey J Bang-Jensen, G Gutin Discrete Mathematics 165, 39-60, 1997	113	1997
Preserving and increasing local edge-connectivity in mixed graphs J Bang-Jensen, A Frank, B Jackson SIAM Journal on Discrete Mathematics 8 (2), 155-178, 1995	100	1995
A polynomial algorithm for the 2-path problem for semicomplete digraphs J Bang-Jensen, C Thomassen SIAM Journal on Discrete Mathematics 5 (3), 366-376, 1992	93	1992
The effect of two cycles on the complexity of colourings by directed graphs J Bang-Jensen, P Hell Discrete applied mathematics 26 (1), 1-23, 1990	91	1990
In-tournament digraphs J Bangjensen, J Huang, E Prisner Journal of Combinatorial Theory, Series B 59 (2), 267-287, 1993	86	1993
Generalizations of tournaments: A survey J Bang–Jensen, G Gutin Journal of Graph Theory 28 (4), 171-202, 1998	85	1998
A classification of locally semicomplete digraphs J Bang-Jensen, Y Guo, G Gutin, L Volkmann Discrete Mathematics 167, 101-114, 1997	84	1997
Edge-connectivity augmentation with partition constraints J Bang-Jensen, HN Gabow, T Jordán, Z Szigeti SIAM Journal on Discrete Mathematics 12 (2), 160-207, 1999	70	1999
Sufficient conditions for a digraph to be Hamiltonian J Bang‐Jensen, G Gutin, H Li Journal of Graph Theory 22 (2), 181-187, 1996	63	1996
Edge-disjoint in-and out-branchings in tournaments and related path problems J Bang-Jensen Journal of Combinatorial Theory, Series B 51 (1), 1-23, 1991	62	1991
Local tournaments and proper circular arc graphs P Hell, J Bang-Jensen, J Huang International Symposium on Algorithms, 101-108, 1990	49	1990
Augmenting hypergraphs by edges of size two J Bang-Jensen, B Jackson Mathematical programming 84, 467-481, 1999	46	1999
Efficient algorithms for real-life instances of the variable size bin packing problem J Bang-Jensen, R Larsen Computers & Operations Research 39 (11), 2848-2857, 2012	43	2012
A new sufficient condition for a digraph to be Hamiltonian J Bang-Jensen, Y Guo, A Yeo Discrete applied mathematics 95 (1-3), 61-72, 1999	43	1999

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用