Mutzel, Petra
Mutzel, Petra 1964-
Petra Mutzel deutsche Mathematikerin, Informatikerin und Hochschullehrerin
Petra Mutzel deutsche Informatikerin
VIAF ID: 47446623 ( Personal )
Permalink: http://viaf.org/viaf/47446623
Preferred Forms
-
- 100 1 _ ‡a Mutzel, Petra
- 100 1 _ ‡a Mutzel, Petra
- 100 1 _ ‡a Mutzel, Petra
-
-
-
-
-
- 100 1 _ ‡a Mutzel, Petra ‡d 1964-
- 100 0 _ ‡a Petra Mutzel ‡c deutsche Informatikerin
- 100 0 _ ‡a Petra Mutzel ‡c deutsche Mathematikerin, Informatikerin und Hochschullehrerin
4xx's: Alternate Name Forms (5)
5xx's: Related Names (4)
- 510 2 _ ‡a Technische Universität Dortmund ‡b Chair of Algorithm Engineering (LS11) ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Technische Universität Dortmund ‡b Fakultät für Informatik ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Technische Universität Wien ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Universität Heidelberg ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
10 Reasons to Get Interested in Graph Drawing | |
alternative method to crossing minimization on hierarchical graphs | |
Automatisiertes Zeichnen von Diagrammen | |
Bishellable drawings of K[sub]n | |
Colored simultaneous geometric embeddings and universal pointsets | |
Combinatorial optimization under ellipsoidal uncertainty | |
Comparing graphs Algorithms & applications | |
Computational molecular biology | |
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization | |
Exact methods for nonlinear combinatorial optimization | |
GD 2001 | |
Graph drawing 05191 abstracts collection ; Dagstuhl seminar | |
Graph drawing : 9th International Symposium, GD 2001, Vienna, Austria, September 23-26, 2001 : revised papers | |
Graph drawing software | |
An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm | |
Learning with graphs: kernel and neural approaches | |
Level Planarity Testing in Linear Time (Full Version) | |
The maximum planar subgraph problem | |
new ILP formulation for 2-root connected prize collecting Steiner networks (TR) | |
On the minimum cut of planarizations | |
Optimal compaction of orthogonal grid drawings | |
Optimizing over all combinatorial embeddings of a planar graph | |
Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem | |
Pitfalls of using PQ-trees in automatic graph drawing | |
Planarity testing and optimal edge insertion with embedding constraints | |
Planarity testing for c-connected clustered graphs | |
polyhedral approach to planar augmentation and related problems | |
Quasi-orthogonal drawing of planar graphs | |
SAHN clustering in arbitrary metric spaces using heuristic nearest neighbor search | |
Scaffold Hunter a comprehensive visual analytics framework for drug discovery | |
Seconds first! A thesis dedicated to secondary structure elements | |
Stochastic survivable network design problems | |
Temporal Graph Algorithms | |
thickness of graphs a survey | |
Tree comparison: enumeration and application to cheminformatics | |
WALCOM: Algorithms and Computation : 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings |