| 2013 | ||
|---|---|---|
| j35 | Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel: Algorithm Engineering im Graphenzeichnen. Informatik Spektrum 36(2): 162-173 (2013) | |
| c82 | Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel: The Rooted Maximum Node-Weight Connected Subgraph Problem. CPAIOR 2013: 300-315 | |
| 2012 | ||
| j34 | Markus Chimani, Petr Hlinený, Petra Mutzel: Vertex insertion approximates the crossing number of apex graphs. Eur. J. Comb. 33(3): 326-335 (2012) | |
| j33 | Markus Chimani, Petra Mutzel, Bernd Zey: Improved Steiner tree algorithms for bounded treewidth. J. Discrete Algorithms 16: 67-78 (2012) | |
| c81 | Karsten Klein, Nils Kriege, Petra Mutzel: Scaffold Hunter - Visual Analysis of Chemical Compound Databases. GRAPP/IVAPP 2012: 626-635 | |
| c80 | ||
| c79 | Denis Kurz, Petra Mutzel, Bernd Zey: Parameterized Algorithms for Stochastic Steiner Tree Problems. MEMICS 2012: 143-154 | |
| e3 | David A. Bader, Petra Mutzel (Eds.): Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012. SIAM / Omnipress 2012 | |
| 2011 | ||
| j32 | Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) | |
| j31 | Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel: An SDP approach to multi-level crossing minimization. ACM Journal of Experimental Algorithmics 17(1) (2011) | |
| j30 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Upward Planarization Layout. J. Graph Algorithms Appl. 15(1): 127-155 (2011) | |
| c78 | Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel: An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126 | |
| c77 | Karsten Klein, Nils Kriege, Petra Mutzel: CT-index: Fingerprint-based graph indexing combining cycles and trees. ICDE 2011: 1115-1126 | |
| c76 | Markus Chimani, Petra Mutzel, Bernd Zey: Improved Steiner Tree Algorithms for Bounded Treewidth. IWOCA 2011: 374-386 | |
| i1 | Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov, Petra Mutzel: Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). Dagstuhl Reports 1(5): 47-60 (2011) | |
| 2010 | ||
| j29 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Layer-free upward crossing minimization. ACM Journal of Experimental Algorithmics 15 (2010) | |
| j28 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. Math. Program. 124(1-2): 413-439 (2010) | |
| c75 | Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel: An Experimental Evaluation of Multilevel Layout Methods. Graph Drawing 2010: 80-91 | |
| c74 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong: Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. Graph Drawing 2010: 141-152 | |
| c73 | Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey: Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) 2010: 427-439 | |
| 2009 | ||
| j27 | Katharina Podwojski, Arno Fritsch, Daniel C. Chamrad, Wolfgang Paul, Barbara Sitek, Kai Stühler, Petra Mutzel, Christian Stephan, Helmut E. Meyer, Wolfgang Urfer, Katja Ickstadt, Jörg Rahnenführer: Retention time alignment algorithms for LC/MS data must consider non-linear shifts. Bioinformatics 25(6): 758-764 (2009) | |
| j26 | Markus Chimani, Carsten Gutwenger, Petra Mutzel: Experiments on exact crossing minimization using column generation. ACM Journal of Experimental Algorithmics 14 (2009) | |
| j25 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics 14 (2009) | |
| c72 | Petra Mutzel: The Crossing Number of Graphs: Theory and Computation. Efficient Algorithms 2009: 305-317 | |
| c71 | Carsten Gutwenger, Petra Mutzel, Bernd Zey: On the Hardness and Approximability of Planar Biconnectivity Augmentation. COCOON 2009: 249-257 | |
| c70 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Upward Planarization Layout. Graph Drawing 2009: 94-106 | |
| c69 | Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel: Port Constraints in Hierarchical Layout of Data Flow Diagrams. Graph Drawing 2009: 135-146 | |
| c68 | Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow: On Open Problems in Biological Network Visualization. Graph Drawing 2009: 256-267 | |
| c67 | Karsten Klein, Nils Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel: Scaffold Hunter - Interactive Exploration of Chemical Space. Graph Drawing 2009: 426-427 | |
| c66 | Carsten Gutwenger, Petra Mutzel, Bernd Zey: Planar Biconnectivity Augmentation with Fixed Embedding. IWOCA 2009: 289-300 | |
| c65 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf: Inserting a vertex into a planar graph. SODA 2009: 375-383 | |
| r1 | ||
| 2008 | ||
| j24 | Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher: A branch-and-cut approach to the crossing number problem. Discrete Optimization 5(2): 373-388 (2008) | |
| j23 | Petra Mutzel: Recent Advances in Exact Crossing Minimization (Extended Abstract). Electronic Notes in Discrete Mathematics 31: 33-36 (2008) | |
| j22 | Carsten Gutwenger, Karsten Klein, Petra Mutzel: Planarity Testing and Optimal Edge Insertion with Embedding Constraints. J. Graph Algorithms Appl. 12(1): 73-95 (2008) | |
| j21 | Dorothea Emig, Melissa S. Cline, Karsten Klein, Anne Kunert, Petra Mutzel, Thomas Lengauer, Mario Albrecht: Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks. J. Integrative Bioinformatics 5(2) (2008) | |
| c64 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36 | |
| c63 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 | |
| c62 | Markus Chimani, Petra Mutzel, Immanuel M. Bomze: A New Approach to Exact Crossing Minimization. ESA 2008: 284-296 | |
| c61 | Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel: Computing Maximum C-Planar Subgraphs. Graph Drawing 2008: 114-120 | |
| c60 | J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz: An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. Graph Drawing 2008: 157-168 | |
| c59 | Markus Chimani, Petr Hlinený, Petra Mutzel: Approximating the Crossing Number of Apex Graphs. Graph Drawing 2008: 432-434 | |
| c58 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Layer-Free Upward Crossing Minimization. WEA 2008: 55-68 | |
| 2007 | ||
| j20 | Markus Chimani, Carsten Gutwenger, Petra Mutzel: On the Minimum Cut of Planarizations. Electronic Notes in Discrete Mathematics 28: 177-184 (2007) | |
| c57 | Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 | |
| c56 | Markus Chimani, Maria Kandyba, Petra Mutzel: A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. ESA 2007: 681-692 | |
| c55 | Markus Chimani, Petra Mutzel, Jens M. Schmidt: Efficient Extraction of Multiple Kuratowski Subdivisions. Graph Drawing 2007: 159-170 | |
| 2006 | ||
| j19 | Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti: An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006) | |
| j18 | Petra Mutzel, René Weiskircher: Bend Minimization in Planar Orthogonal Drawings Using Integer Programming. SIAM Journal on Optimization 17(3): 665-687 (2006) | |
| c54 | Carsten Gutwenger, Karsten Klein, Petra Mutzel: Planarity Testing and Optimal Edge Insertion with Embedding Constraints. Graph Drawing 2006: 126-137 | |
| c53 | Wilhelm Barth, Petra Mutzel, Canan Yildiz: A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. Graph Drawing 2006: 343-354 | |
| c52 | Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl: A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR 2006: 197-202 | |
| c51 | Markus Chimani, Carsten Gutwenger, Petra Mutzel: Experiments on Exact Crossing Minimization Using Column Generation. WEA 2006: 303-315 | |
| e2 | Michael Jünger, Stephen G. Kobourov, Petra Mutzel (Eds.): Graph Drawing, 8.-13. May 2005. Dagstuhl Seminar Proceedings 05191, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 | |
| 2005 | ||
| j17 | Carsten Gutwenger, Petra Mutzel, René Weiskircher: Inserting an Edge into a Planar Graph. Algorithmica 41(4): 289-308 (2005) | |
| c50 | Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti: Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76 | |
| c49 | Stefan Hetzl, Petra Mutzel: A Graph-Theoretic Approach to Steganography. Communications and Multimedia Security 2005: 119-128 | |
| c48 | Michael Jünger, Stephen G. Kobourov, Petra Mutzel: 05191 Executive Summary - Graph Drawing. Graph Drawing 2005 | |
| c47 | Michael Jünger, Petra Mutzel, Stephen G. Kobourov: 05191 Abstracts Collection - Graph Drawing. Graph Drawing 2005 | |
| c46 | Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher: Exact Crossing Minimization. Graph Drawing 2005: 37-48 | |
| c45 | ||
| 2004 | ||
| j16 | 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. Information Visualization 3(3): 189-208 (2004) | |
| j15 | Wilhelm Barth, Petra Mutzel, Michael Jünger: Simple and Efficient Bilayer Cross Counting. J. Graph Algorithms Appl. 8(2): 179-194 (2004) | |
| c44 | Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher: Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315 | |
| 2003 | ||
| j14 | Petra Mutzel, Michael Jünger: Guest Editors' Foreword. J. Graph Algorithms Appl. 7(4): 307-309 (2003) | |
| j13 | Gunnar W. Klau, Petra Mutzel: Optimal labeling of point features in rectangular labeling models. Math. Program. 94(2-3): 435-458 (2003) | |
| c43 | Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher: The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA 2003: 691-702 | |
| c42 | Carsten Gutwenger, Petra Mutzel: An Experimental Study of Crossing Minimization Heuristics. Graph Drawing 2003: 13-24 | |
| c41 | Carsten Gutwenger, Petra Mutzel: Graph Embedding with Minimum Depth and Maximum External Face. Graph Drawing 2003: 259-272 | |
| c40 | Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel: Selected Open Problems in Graph Drawing. Graph Drawing 2003: 515-539 | |
| c39 | ||
| c38 | Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel: A New Approach for Visualizing UML Class Diagrams. SOFTVIS 2003: 179-188, 217-218 | |
| c37 | Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher: Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272 | |
| 2002 | ||
| c36 | Petra Mutzel, René Weiskircher: Bend Minimization in Orthogonal Drawings Using Integer Programming. COCOON 2002: 484-493 | |
| c35 | Wilhelm Barth, Michael Jünger, Petra Mutzel: Simple and Efficient Bilayer Cross Counting. Graph Drawing 2002: 130-141 | |
| c34 | Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher: Advances in C-Planarity Testing of Clustered Graphs. Graph Drawing 2002: 220-235 | |
| e1 | Petra Mutzel, Michael Jünger, Sebastian Leipert (Eds.): Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers. Lecture Notes in Computer Science 2265, Springer 2002, isbn 3-540-43309-0 | |
| 2001 | ||
| j12 | Petra Mutzel: An Alternative Method to Crossing Minimization on Hierarchical Graphs. SIAM Journal on Optimization 11(4): 1065-1080 (2001) | |
| c33 | Petra Mutzel, Peter Eades: Graphs in Software Visualization - Introduction. Software Visualization 2001: 285-294 | |
| c32 | Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel: Graph Drawing Algorithm Engineering with AGD. Software Visualization 2001: 307-323 | |
| c31 | Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel: Caesar Automatic Layout of UML Class Diagrams. Graph Drawing 2001: 461-462 | |
| c30 | Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher: AGD: A Library of Algorithms for Graph Drawing. Graph Drawing 2001: 473-474 | |
| c29 | Carsten Gutwenger, Petra Mutzel, René Weiskircher: Inserting an edge into a planar graph. SODA 2001: 246-255 | |
| 2000 | ||
| j11 | John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron: A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics 104(1-3): 143-186 (2000) | |
| c28 | ||
| c27 | Gunnar W. Klau, Petra Mutzel: Optimal Labelling of Point Features in the Slider Model. COCOON 2000: 340-350 | |
| c26 | Gunnar W. Klau, Karsten Klein, Petra Mutzel: An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). Graph Drawing 2000: 37-51 | |
| c25 | Carsten Gutwenger, Petra Mutzel: A Linear Time Implementation of SPQR-Trees. Graph Drawing 2000: 77-90 | |
| 1999 | ||
| j10 | Giuseppe Di Battista, Petra Mutzel: Guest Editors' Introduction. J. Graph Algorithms Appl. 3(4): 1-2 (1999) | |
| c24 | ||
| c23 | Petra Mutzel, Thomas Ziegler: The Constrained Crossing Minimization Problem. Graph Drawing 1999: 175-185 | |
| c22 | Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber: Graph-Drawing Contest Report. Graph Drawing 1999: 400-409 | |
| c21 | Petra Mutzel, René Weiskircher: Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen. GI Jahrestagung 1999: 199-206 | |
| c20 | ||
| c19 | Petra Mutzel, René Weiskircher: Optimizing over All Combinatorial Embeddings of a Planar Graph. IPCO 1999: 361-376 | |
| 1998 | ||
| j9 | Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt: The thickness of a minor-excluded class of graphs. Discrete Mathematics 182(1-3): 169-176 (1998) | |
| j8 | Petra Mutzel, Thomas Odenthal, Mark Scharbrodt: The Thickness of Graphs: A Survey. Graphs and Combinatorics 14(1): 59-73 (1998) | |
| j7 | Michael Jünger, Sebastian Leipert, Petra Mutzel: A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. on CAD of Integrated Circuits and Systems 17(7): 609-612 (1998) | |
| c18 | Carsten Gutwenger, Petra Mutzel: Planar Polyline Drawings with Good Angular Resolution. Graph Drawing 1998: 167-182 | |
| c17 | Michael Jünger, Sebastian Leipert, Petra Mutzel: Level Planarity Testing in Linear Time. Graph Drawing 1998: 224-237 | |
| c16 | Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1998: 423-435 | |
| c15 | 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. Graph Drawing 1998: 456-457 | |
| c14 | ||
| c13 | Sergej Fialko, Petra Mutzel: A New Approximation Algorithm for the Planar Augmentation Problem. SODA 1998: 260-269 | |
| c12 | Therese C. Biedl, Michael Kaufmann, Petra Mutzel: Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136 | |
| 1997 | ||
| j6 | Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel: Algorithmen zum automatischen Zeichnen von Graphen. Informatik Spektrum 20(4): 199-207 (1997) | |
| j5 | Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt: A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. Journal of Computational Biology 4(4): 433-447 (1997) | |
| j4 | Michael Jünger, Petra Mutzel: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms Appl. 1 (1997) | |
| c11 | Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal: A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. Graph Drawing 1997: 13-24 | |
| c10 | Michael Jünger, Sebastian Leipert, Petra Mutzel: Pitfalls of Using PQ-Trees in Automatic Graph Drawing. Graph Drawing 1997: 193-204 | |
| c9 | Christoph Hundack, Petra Mutzel, Igor Pouchkarev, Stefan Thome: ArchE: A Graph Drawing System for Archaeology. Graph Drawing 1997: 297-302 | |
| c8 | Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel, Thomas Lengauer: Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. GI Jahrestagung 1997: 58-67 | |
| c7 | Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt: A branch-and-cut approach to physical mapping with end-probes. RECOMB 1997: 84-92 | |
| c6 | Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu: A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250 | |
| 1996 | ||
| j3 | Michael Jünger, Petra Mutzel: Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica 16(1): 33-59 (1996) | |
| j2 | Kurt Mehlhorn, Petra Mutzel: On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica 16(2): 233-242 (1996) | |
| c5 | Petra Mutzel: An Alternative Method to Crossing Minimization on Hierarchical Graphs. Graph Drawing 1996: 318-333 | |
| 1995 | ||
| c4 | ||
| c3 | Michael Jünger, Petra Mutzel: Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. Graph Drawing 1995: 337-348 | |
| 1994 | ||
| c2 | Michael Jünger, Petra Mutzel: The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. Graph Drawing 1994: 119-130 | |
| 1993 | ||
| j1 | M. Schäffter, Karsten Weihe, Petra Mutzel, Salah E. Elmaghraby: Book reviews. Math. Meth. of OR 37(1): 112-117 (1993) | |
| c1 | ||
Colors in the list of coauthors
Last update Thu May 23 11:52:19 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page