Andreas Weißl

According to our database, Andreas Weißl authored at least 5 papers between 2004 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

The Number of Graphs Not Containing K_{3, 3} as a Minor.

Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl

Electron. J. Comb., 2008

2007

On Euclidean Vehicle Routing with Allocation.

Jan Remy, Reto Spöhel, Andreas Weißl

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2005

Fast Algorithms for Weighted Bipartite Matching.

Justus Schwartz, Angelika Steger, Andreas Weißl

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Random planar graphs with <i>n</i> nodes and a fixed number of edges.

Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

E-Jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen.

Martin Marciniszyn, Angelika Steger, Andreas Weißl

Inform. Spektrum, 2004