dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Andreas Darmann Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Paths, trees and matchings under disjunctive constraints. Discrete Applied Mathematics 159(16): 1726-1735 (2011)
2010
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Darmann, Christian Klamler, Ulrich Pferschy: A note on maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 60(1): 82-85 (2010)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Darmann, Ulrich Pferschy, Joachim Schauer: Resource allocation with time intervals. Theor. Comput. Sci. 411(49): 4217-4234 (2010)
2009
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Darmann, Ulrich Pferschy, Joachim Schauer: Determining a Minimum Spanning Tree with Disjunctive Constraints. ADT 2009: 414-423
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Combinatorial Optimization Problems with Conflict Graphs. CTW 2009: 293-296
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Darmann, Christian Klamler, Ulrich Pferschy: Maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 58(2): 238-250 (2009)

Coauthor Index

1Christian Klamler [1] [5]
2Ulrich Pferschy [1] [2] [3] [4] [5] [6]
3Joachim Schauer [2] [3] [4] [6]
4Gerhard J. Woeginger [2] [6]

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page