The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carsten Gutwenger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi
    Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. [Citation Graph (0, 0)][DBLP]
    Computational Combinatorial Optimization, 2001, pp:157-222 [Conf]
  2. Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel
    Graph Drawing Algorithm Engineering with AGD. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:307-323 [Conf]
  3. Carsten Gutwenger, Markus Chimani
    Non-planar Core Reduction of Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:223-234 [Conf]
  4. Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
    Caesar Automatic Layout of UML Class Diagrams. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:461-462 [Conf]
  5. Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher
    AGD: A Library of Algorithms for Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:473-474 [Conf]
  6. Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
    Advances in C-Planarity Testing of Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:220-235 [Conf]
  7. Carsten Gutwenger, Joachim Kupke, Karsten Klein, Sebastian Leipert
    GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:123-128 [Conf]
  8. Carsten Gutwenger, Petra Mutzel
    A Linear Time Implementation of SPQR-Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:77-90 [Conf]
  9. Carsten Gutwenger, Petra Mutzel
    An Experimental Study of Crossing Minimization Heuristics. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:13-24 [Conf]
  10. Carsten Gutwenger, Petra Mutzel
    Graph Embedding with Minimum Depth and Maximum External Face. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:259-272 [Conf]
  11. Carsten Gutwenger, Petra Mutzel
    Planar Polyline Drawings with Good Angular Resolution. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:167-182 [Conf]
  12. Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert
    A Library of Algorithms for Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:456-457 [Conf]
  13. Carsten Gutwenger, Karsten Klein, Petra Mutzel
    Planarity Testing and Optimal Edge Insertion with Embedding Constraints. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:126-137 [Conf]
  14. Carsten Gutwenger, Petra Mutzel, René Weiskircher
    Inserting an edge into a planar graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:246-255 [Conf]
  15. Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
    A New Approach for Visualizing UML Class Diagrams. [Citation Graph (0, 0)][DBLP]
    SOFTVIS, 2003, pp:179-188 [Conf]
  16. Markus Chimani, Carsten Gutwenger, Petra Mutzel
    Experiments on Exact Crossing Minimization Using Column Generation. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:303-315 [Conf]
  17. Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
    Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:261-272 [Conf]
  18. Carsten Gutwenger, Petra Mutzel, René Weiskircher
    Inserting an Edge into a Planar Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:4, pp:289-308 [Journal]
  19. Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller
    Automatic layout of UML class diagrams in orthogonal style. [Citation Graph (0, 0)][DBLP]
    Information Visualization, 2004, v:3, n:3, pp:189-208 [Journal]
  20. Ulrik Brandes, Cesim Erten, J. Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, S. Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
    Colored Simultaneous Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:254-263 [Conf]

  21. On the Hardness and Approximability of Planar Biconnectivity Augmentation. [Citation Graph (, )][DBLP]


  22. Graph Drawing Contest Report. [Citation Graph (, )][DBLP]


  23. An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP]


  24. Computing Maximum C-Planar Subgraphs. [Citation Graph (, )][DBLP]


  25. Graph Drawing Contest Report. [Citation Graph (, )][DBLP]


  26. Upward Planarization Layout. [Citation Graph (, )][DBLP]


  27. Algorithms for the Hypergraph and the Minor Crossing Number Problems. [Citation Graph (, )][DBLP]


  28. Inserting a vertex into a planar graph. [Citation Graph (, )][DBLP]


  29. Layer-Free Upward Crossing Minimization. [Citation Graph (, )][DBLP]


  30. Planar Biconnectivity Augmentation with Fixed Embedding. [Citation Graph (, )][DBLP]


  31. HONEI: A collection of libraries for numerical computations targeting multiple processor architectures [Citation Graph (, )][DBLP]


  32. Non-planar core reduction of graphs. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002