Andreas Brandstädt

1. BRANDSTÄDT, Andreas, LE, Van Bang, SPINRAD, Jeremy P. Graph classes : a survey. Philadelphia: SIAM, cop. 1999. XI, 304 str., ilustr. SIAM monographs on discrete mathematics and applications. ISBN 0-89871-432-X. [COBISS.SI-ID 8835673]

2. BRANDSTÄDT, Andreas (urednik), KRATSCH, Dieter (urednik), MÜLLER, Haiko (urednik). Graph-theoretic concepts in computer science : 33rd international workshop, WG 2007, Dornburg, Germany, June 21-23, 2007 : revised papers. Berlin; New York: Springer, cop. 2007. XIII, 340 str., ilustr. Lecture notes in computer science, 4769, LNCS sublibrary, SL 1, Theoretical computer science and general issues. ISBN 978-3-540-74838-0, ISBN 3-540-74838-5. ISSN 0302-9743. http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4769. [COBISS.SI-ID 2123493]

3. BRANDSTÄDT, Andreas (urednik), JANSEN, Klaus (urednik), REISCHUK, Rüdiger (urednik), WG 2013, 39th International Workshop on Graph-Theoretic Concepts in Computer Science, June 19 - 21, 2013, Lübeck, Germany. Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 : revised papers. Heidelberg [etc.]: Springer, cop. 2013. XIII, 430 str., ilustr. Lecture notes in computer science, 8165. ISBN 978-3-642-45042-6, ISBN 978-3-642-45043-3. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-45043-3, DOI: 10.1007/978-3-642-45043-3. [COBISS.SI-ID 1536085444]

4. BRANDSTÄDT, Andreas, MILANIČ, Martin, NEVRIES, Ragnar. New polynomial cases of the weighted efficient domination problem. V: CHATTERJEE, Krishnendu (ur.), SGALL, Jiří (ur.). Mathematical foundations of computer science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013 : proceedings. Berlin: Springer, 2013. Str. 195-206. Lecture notes in computer science, 8087. ISBN 978-3-642-40312-5. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-40313-2_19, DOI: 10.1007/978-3-642-40313-2_19. [COBISS.SI-ID 1024532564]

5. BRANDSTÄDT, Andreas, FIČUR, Pavel, LEITERT, Arne, MILANIČ, Martin. Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Information processing letters. [Print ed.]. 2015, vol. 115, issue 2, str. 256-262. ISSN 0020-0190. http://www.sciencedirect.com/science/article/pii/S0020019014002014, DOI: 10.1016/j.ipl.2014.09.024. [COBISS.SI-ID 1537012420]

6. BRANDSTÄDT, Andreas, GIAKOUMAKIS, Vassilis, MILANIČ, Martin. Weighted efficient domination for some classes of H-free and of (H1,H2)-free graphs. Discrete applied mathematics. [Print ed.]. 2018, vol. 250, str. 130-144. ISSN 0166-218X. https://doi.org/10.1016/j.dam.2018.05.012, DOI: 10.1016/j.dam.2018.05.012. [COBISS.SI-ID 1540387780]

7. BRANDSTÄDT, Andreas, MILANIČ, Martin. A dichotomy for weighted efficient dominating sets with bounded degree vertices. Information processing letters. [Print ed.]. 2019, vol. 142, str. 30-34. ISSN 0020-0190. https://www.sciencedirect.com/science/article/pii/S002001901830200X?via%3Dihub, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1016/j.ipl.2018.10.007. [COBISS.SI-ID 1540954052]