Dagmar Handke

According to our database, Dagmar Handke authored at least 8 papers between 1997 and 2005.

Collaborative distances:

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

2005

Self-spanner graphs.

Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke

Discret. Appl. Math., 2005

2001

Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees.

Dagmar Handke

Discret. Appl. Math., 2001

2000

Tree Spanners for Subgraphs and Related Tree Covering Problems.

Dagmar Handke, Guy Kortsarz

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999

Graphs with distance guarantees.

Dagmar Handke

PhD thesis, 1999

Survivable Networks with Bounded Delay: The Edge Failure Case.

Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

<i>NP</i>-Completeness Results for Minimum Planar Spanners.

Ulrik Brandes, Dagmar Handke

Discret. Math. Theor. Comput. Sci., 1998

Independent Tree Spanners.

Dagmar Handke

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

NP-Completness Results for Minimum Planar Spanners.

Ulrik Brandes, Dagmar Handke

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997