Gabriele Neyer

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2001
c5		Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402
	2000
c4		Gabriele Neyer, Frank Wagner: Labeling Downtown. CIAC 2000: 113-124
	1999
j1		Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe: A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. Discrete Applied Mathematics 92(2-3): 91-110 (1999)
c3		Gabriele Neyer: Map Labeling with Application to Graph Drawing. Drawing Graphs 1999: 247-273
c2		Gabriele Neyer: Line Simplification with Restricted Orientations. WADS 1999: 13-24
e1		Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Eds.): Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Lecture Notes in Computer Science 1665, Springer 1999, isbn 3-540-66731-8
	1997
c1		Gabriele Neyer, Peter Widmayer: Singularities Make Spatial Join Scheduling Hard. ISAAC 1997: 293-302

Coauthor Index

Last update Thu May 23 20:18:08 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page