- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Konstanz, Universität Konstanz, Diplomarbeit, 2002
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2011
- Creator
-
Köpf, Boris Alexander
- URN
-
urn:nbn:de:bsz:352-opus-9425
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Köpf, Boris Alexander
- Bibliothek der Universität Konstanz
Time of origin
- 2011
Other Objects (12)
Parallel algorithms on planar graphs
New Parameters for Beyond-Planar Graphs
Combinatorial Concepts and Algorithms for Drawing Planar Graphs
Planar Graph Drawing
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Fixed-Parameter Tractable Distances to Sparse Graph Classes
Fixed parameter algorithms for some combinatorial problems in bioinformatics
Fixed-parameter algorithms for some combinatorial problems in bioinformatics
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Parallel algorithms on planar graphs
New Parameters for Beyond-Planar Graphs
Combinatorial Concepts and Algorithms for Drawing Planar Graphs
Planar Graph Drawing
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Fixed-Parameter Tractable Distances to Sparse Graph Classes
Fixed parameter algorithms for some combinatorial problems in bioinformatics
Fixed-parameter algorithms for some combinatorial problems in bioinformatics
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Parallel algorithms on planar graphs
New Parameters for Beyond-Planar Graphs
Combinatorial Concepts and Algorithms for Drawing Planar Graphs
Planar Graph Drawing
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Fixed-Parameter Tractable Distances to Sparse Graph Classes
Fixed parameter algorithms for some combinatorial problems in bioinformatics
Fixed-parameter algorithms for some combinatorial problems in bioinformatics