Andreas Brandstädt 个人学术档案

引用次数

	总计	2019 年至今
引用	7213	1637
h 指数	40	18
i10 指数	104	39

480

240

120

360

19921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202422 35 35 62 46 81 73 109 79 87 110 204 189 265 217 267 214 259 256 303 265 354 331 384 469 394 317 323 314 313 283 244 159

开放获取的出版物数量

查看全部

12 篇文章

1 篇文章

可查看的文章

无法查看的文章

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

合著作者

Van Bang LeUniversity of Rostock, Germany在 uni-rostock.de 的电子邮件经过验证
Feodor F. DraganKent State University在 CS.KENT.EDU 的电子邮件经过验证
Dieter Kratschprofesseur d'informatique, Universite de Lorraine在 univ-lorraine.fr 的电子邮件经过验证
Vadim LozinUniversity of Warwick在 warwick.ac.uk 的电子邮件经过验证
Chinh T. HoangProfessor of Computer Science, Wilfrid Laurier University在 wlu.ca 的电子邮件经过验证
Vitaly I. VoloshinTroy University, USA在 troy.edu 的电子邮件经过验证
Hans L. BodlaenderProfessor Computer Science, Utrecht University在 uu.nl 的电子邮件经过验证
Martin MilaničUniversity of Primorska, Koper, Slovenia在 upr.si 的电子邮件经过验证
Ragnar NevriesPhD student, University of Rostock, Germany在 uni-rostock.de 的电子邮件经过验证
Fábio ProttiFull Professor, Fluminense Federal University在 ic.uff.br 的电子邮件经过验证
Loana Tito NogueiraProfessora do Departamento de Ciência da Computação, Universidade Federal Fluminense在 ic.uff.br 的电子邮件经过验证
Ryuhei UeharaJapan Advanced Institute of Science and Technology在 jaist.ac.jp 的电子邮件经过验证
Stephan OlariuOld Dominion University在 odu.edu 的电子邮件经过验证
Martin GolumbicProfessor of Computer Science, University of Haifa在 cs.haifa.ac.il 的电子邮件经过验证
Yang XiangGraphSQL, Inc.在 graphsql.com 的电子邮件经过验证
Joost Engelfrietassociate professor, LIACS, Leiden University在 liacs.leidenuniv.nl 的电子邮件经过验证
Yang XiangIEEE Fellow, Professfor, Swinburne University of Technology在 swin.edu.au 的电子邮件经过验证

关注

Andreas Brandstädt

Professor of Computer Science, University of Rostock, Germany

在 uni-rostock.de 的电子邮件经过验证 - 首页

graph algorithms graph classes complexity


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Graph classes: a survey A Brandstädt, VB Le, JP Spinrad Society for Industrial and Applied Mathematics, 1999	2384	1999
Bipartite permutation graphs J Spinrad, A Brandstädt, L Stewart Discrete Applied Mathematics 18 (3), 279-292, 1987	301	1987
Van Bang Le, and Jeremy P. Spinrad A Brandstädt Graph classes: a survey 3, 1999	198	1999
Dually chordal graphs A Brandstädt, F Dragan, V Chepoi, V Voloshin SIAM Journal on Discrete Mathematics 11 (3), 437-455, 1998	189	1998
The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs H Müller, A Brandstädt Theoretical Computer Science 53 (2-3), 257-265, 1987	169	1987
The algorithmic use of hypertree structure and maximum neighbourhood orderings A Brandstädt, VD Chepoi, FF Dragan Discrete Applied Mathematics 82 (1-3), 43-77, 1998	148	1998
Partitions of graphs into one or two independent sets and cliques A Brandstädt Discrete Mathematics 152 (1-3), 47-54, 1996	136	1996
On domination problems for permutation and other graphs A Brandstädt, D Kratsch Theoretical Computer Science 54 (2-3), 181-198, 1987	112	1987
Special graph classes: A survey A Brandstädt UD, Fachbereich Mathematik, 1991	99	1991
On the linear structure and clique-width of bipartite permutation graphs A Brandstadt Ars Combinatoria 67, 273-281, 2003	95	2003
Distance approximating trees for chordal and dually chordal graphs A Brandstädt, V Chepoi, F Dragan Journal of Algorithms 30 (1), 166-184, 1999	93	1999
Convexity and HHD-free graphs FF Dragan, F Nicolai, A Brandstädt SIAM Journal on Discrete Mathematics 12 (1), 119-135, 1999	92	1999
Graphen und Algorithmen A Brandstädt Springer-Verlag, 2013	88	2013
The complexity of some problems related to graph 3-colorability A Brandstädt, T Szymczak Discrete Applied Mathematics 89 (1-3), 59-73, 1998	86	1998
New graph classes of bounded clique-width A Brandstädt, FF Dragan, HO Le, R Mosca Theory of Computing Systems 38 (5), 623-645, 2005	80	2005
Handbook of graph theory, combinatorial optimization, and algorithms K Thulasiraman, S Arumugam, A Brandstädt (No Title), 2016	78	2016
Structure and linear time recognition of 3-leaf powers A Brandstädt Information Processing Letters 98 (4), 133-138, 2006	73	2006
LexBFS-orderings and powers of chordal graphs A Brandstädt, FF Dragan, F Nicolai Discrete Mathematics 171 (1-3), 27-42, 1997	71	1997
On the restriction of some NP-complete graph problems to permutation graphs A Brandstädt, D Kratsch Fundamentals of Computation Theory: FCT'85 Cottbus, GDR, September 9–13 …, 1985	70	1985
On clique separators, nearly chordal graphs, and the maximum weight stable set problem A Brandstädt, CT Hoàng Theoretical Computer Science 389 (1-2), 295-306, 2007	65	2007

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用