Christopher G. Wagner

According to our database, Christopher G. Wagner authored at least 4 papers between 1999 and 2004.

Collaborative distances:

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

2004

Compact roundtrip routing in directed networks.

Lenore Cowen, Christopher G. Wagner

J. Algorithms, 2004

2000

A Framework for Drawing Planar Graphs with Curves and Polylines.

Michael T. Goodrich, Christopher G. Wagner

J. Algorithms, 2000

Compact roundtrip routing in directed networks (extended abstract).

Lenore Cowen, Christopher G. Wagner

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999

Compact Roundtrip Routing for Digraphs.

Lenore Cowen, Christopher G. Wagner

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999