Andreas Brandstädt

Cited by

	All	Since 2019
Citations	7271	1681
h-index	41	18
i10-index	104	40

480

240

120

360

19921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202422 38 35 63 46 81 73 110 79 87 111 197 189 265 217 267 214 266 256 306 263 354 332 384 467 397 317 322 317 307 279 241 214

Public access

View all

12 articles

1 article

available

not available

Based on funding mandates

Co-authors

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

Andreas Brandstädt

Professor of Computer Science, University of Rostock, Germany

Verified email at uni-rostock.de - Homepage

graph algorithms graph classes complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Graph classes: a survey A Brandstädt, VB Le, JP Spinrad Society for Industrial and Applied Mathematics, 1999	2397	1999
Bipartite permutation graphs J Spinrad, A Brandstädt, L Stewart Discrete Applied Mathematics 18 (3), 279-292, 1987	303	1987
Van Bang Le, and Jeremy P. Spinrad A Brandstädt Graph classes: a survey 3, 1999	208	1999
Dually chordal graphs A Brandstädt, F Dragan, V Chepoi, V Voloshin SIAM Journal on Discrete Mathematics 11 (3), 437-455, 1998	190	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	172	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	101	1991
On the linear structure and clique-width of bipartite permutation graphs A Brandstadt Ars Combinatoria 67, 273-281, 2003	96	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	85	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	66	2007

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors