Universität zu Köln

A

Apke, Alexander and Schrader, Rainer (2015). On the non-unit count of interval graphs. Discrete Applied Mathematics, 195. pp. 2-7. Elsevier.

Anjos, Miguel F., Liers, Frauke, Pardella, Gregor and Schmutzer, Andreas (2013). Engineering Branch-and-Cut Algorithms for the Equicut Problem. In: Discrete Geometry and Optimization, Berlin: Springer.

Anjos, Miguel, Ghaddar, Bissan, Hupp, Lena, Liers, Frauke and Wiegele, Angelika ORCID: 0000-0003-1670-7951 (2013). Solving k-way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method. In: Facets of Combinatorial Optimization : Festschrift for Martin Grötschel, pp. 355-386. Berlin: Springer.

Anjos, Miguel and Liers, Frauke (2011). Global Approaches for Facility Layout and VLSI Floorplanning. In: Handbook on Semidefinite, Conic and Polynomial Optimization, Berlin: Springer.

Anjos, Miguel and Vannelli, Anthony (2006). A New Mathematical Programming Framework for Facility Layout Design. INFORMS journal on computing : JOC, 18 (1). pp. 111-118. Informs.

Akkerman, Thorsten, Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Teske, Daniel (2004). On the Complexity of Drawing Trees Nicely: Corrigendum. Acta Informatica, 40 (8). pp. 603-607. Springer.

Althaus, Ernst, Bockmayr, Alexander, Elf, Matthias, Kasper, Thomas, Jünger, Michael and Mehlhorn, Kurt (2002). SCIL - Symbolic Constraints in Integer Linear Programming. In: Algorithms - ESA 2002 : 10th annual European symposium, Rome, Italy, September 17 - 21, 2002 ; proceedings, pp. 75-87. Springer.

B

Buarque de Amorim, Tiago Luiz ORCID: 0000-0003-0930-2307 (2021). Model-based systems engineering maturity improvement in industry. PhD thesis, Universität zu Köln.

Bonato, Thorsten, Jünger, Michael, Reinelt, Gerhard and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (2013). Lifting and Separation Procedures for the Cut Polytope. Mathematical Programming A. Springer.

Bomze, Immanuel, Chimani, Markus, Jünger, Michael, Ljubic, Ivana, Mutzel, Petra ORCID: 0000-0001-7621-971X and Zey, Bernd (2011). Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. In: ISAAC 2010, Part I, pp. 427-439. Heidelberg: Springer-Verlag.

Buchheim, Christoph, Liers, Frauke and Sanita, Laura (2011). An Exact Algorithm for Robust Network Design. In: Network Optimization : 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, pp. 7-14. Springer Verlag.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Liers, Frauke and Oswald, Marcus (2010). Speeding up IP-based Algorithms for Constrained Quadratic 0-1 Optimization. Mathematical Programming B, 124 (1-2). pp. 513-535. Springer.

Baumann, Frank, Buchheim, Christoph ORCID: 0000-0001-9974-404X and Liers, Frauke (2010). Exact Bipartite Crossing Minimization under Tree Constraints. In: 9th International Symposium on Experimental Algorithms SEA 2010, pp. 118-128. Springer Verlag.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Michaels, Dennis and Weismantel, Robert (2010). Integer Programming Subject to Monomial Constraints. SIAM journal on optimization : a publication of the Society for Industrial and Applied Mathematics, 20 (6). pp. 3297-3311. SIAM.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Cameron, Peter J. and Wu, Taoyang (2009). On the Subgroup Distance Problem. Discrete Mathematics, 309 (4). pp. 962-968. Elsevier Science.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (2009). Terse Integer Linear Programs for Boolean Optimization. Journal on Satisfiability, Boolean Modeling and Computation, 6. pp. 121-139.

Baumann, Frank and Buchheim, Christoph ORCID: 0000-0001-9974-404X (2009). Compact and Extended Formulations for Range Assignment Problems. Working Paper.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Chimani, Markus, Ebner, Dietmar, Gutwenger, Carsten, Klau, Gunnar W., Mutzel, Petra ORCID: 0000-0001-7621-971X and Weiskircher, René (2008). A branch-and-cut approach to the crossing number problem. Discrete optimization, 5 (2). pp. 373-388. Elsevier.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Hong, Seok-Hee (2008). Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica, 52 (4). pp. 448-465. Springer.

Behle, Markus, Jünger, Michael and Liers, Frauke (2007). A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. In: Experimental algorithms : 6th international workshop ; proceedings / WEA 2007, Rome, Italy, June 6 - 8, pp. 379-392. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Percan, Merijam, Schulz, Michael and Thelen, Christina (2007). Drawing cycles in networks. Working Paper.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Wiegele, Angelika ORCID: 0000-0003-1670-7951 and Zheng, Lanbo (2007). Exact Algorithms for the Quadratic Linear Ordering Problem. INFORMS Journal on Computing, 22 (1). pp. 168-177. Informs.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Kandyba, Maria, Percan, Merijam and Schulz, Michael (2007). Planarization With Fixed Subgraph Embedding. Working Paper.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Zheng, Lanbo (2006). Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. In: Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15 - 18, 2006 ; proceedings, pp. 507-516. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Jünger, Michael (2005). Linear Optimization over Permutation Groups. Discrete Optimization, 2 (4). pp. 308-319. Springer.

Barth, Wilhelm, Mutzel, Petra ORCID: 0000-0001-7621-971X and Jünger, Michael (2004). Simple and Efficient Bilayer Cross Counting (Journal Version). Journal of Graph Algorithms and Applications, 8 (21). pp. 179-194. Brown University.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Jünger, Michael (2004). An Integer Programming Approach to Fuzzy Symmetry Detection. In: Graph drawing 11th International Symposium, GD 2003, Perugia, Italy, September 21 - 24, 2003 ; revised papers, pp. 166-177. Springer.

Buchheim, Christoph (2003). An Integer Programming Approach to Exact and Fuzzy Symmetry Detection. PhD thesis, Universität zu Köln.

Barth, Wilhelm, Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (2002). Simple and Efficient Bilayer Cross Counting. In: Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, pp. 331-360. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Hong, Seok-Hee (2002). Crossing Minimization for Symmetries (Extended Abstract). In: Algorithms and Computation : 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002 ; proceedings, pp. 137-152. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Leipert, Sebastian (2001). A Fast Layout Algorithm for k-Level Graphs. Springer.

Bolten, Eva, Schliep, Alexander, Schneckener, Sebastian, Schomburg, Dietmar and Schrader, Rainer (2001). Clustering Protein Sequences - Structure Prediction by transitive homology. Bioinformatics, 17 (10). pp. 935-941. Oxford University Press.

Bolten, Eva, Schliep, Alexander, Schneckener, Sebastian, Schomburg, Dietmar and Schrader, Rainer (2001). Strongly Connected Components can Predict Protein Structure. Elsevier.

Böhm, Max (1999). Parallel ABACUS - Introduction and Tutorial. Working Paper.

Böhm, Max (1999). Parallel ABACUS - Implementation. Technical Report.

Brandenburg, Franz J., Jünger, Michael, Marks, Joe, Mutzel, Petra ORCID: 0000-0001-7621-971X and Schreiber, Falk (1999). Graph-Drawing Contest Report. Springer.

Böhm, Max and Speckenmeyer, Ewald (1997). Precomputation-based Load Balancing. World Scientific. ["eprint_fieldopt_monograph_type_preprint" not defined].

Brandenburg, Franz J., Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1997). Algorithmen zum automatischen Zeichnen von Graphen. Informatik-Spektrum, 20 (4). pp. 199-207. Springer.

Bachem, Achim, Bodmann, M., Bolz, Georg, Emden-Weinert, Thomas, Erdmann, Andreas, Monien, Burkhard, Kiahaschemi, Mehran and and Jörg Schepers and Rainer Schrader and Jürgen Schulze and Ste, Hans J. Prömel (1997). Verbundprojekt PARALOR: Parallele Verfahren zur Wegoptimierung in Flugplanung und Logistik. DLR.

Böhm, Max and Speckenmeyer, Ewald (1996). A Fast Parallel SAT-Solver - Efficient Workload Balancing. Baltzer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Bachem, Achim, Monien, Burkhard, J., Hans, Schrader, Rainer ORCID: 0000-0001-6635-0132 and Voigt, Bernd (1996). Verbundprojekt PARALOR: Parallele Algorithmen für Routingprobleme im Flug- und Straßenverkehr. Working Paper.

C

Cacchiani, Valentina, Jünger, Michael, Liers, Frauke, Lodi, Andrea and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2014). Single-Commodity Robust Network Design with Finite and Hose Demand Sets. Working Paper.

Chimani, Markus, Jünger, Michael and Schulz, Michael (2008). Crossing Minimization meets Simultaneous Drawing. In: Proceedings : IEEE Pacific Visualisation Symposium 2008 ; Kyoto, Japan, 5 - 7 March 2008, pp. 33-40. IEEE.

Cizek, Jiri (2005). Robust Algorithms for Registration of 3D Images of Human Brain. PhD thesis, Universität zu Köln.

Chevalier, Thomas (2004). Ein Risikomodell für Bausparkollektive. PhD thesis, Universität zu Köln.

Christof, Thomas, Jünger, Michael, Kececioglu, John, Mutzel, Petra ORCID: 0000-0001-7621-971X and Reinelt, Gerhard (1997). A branch-and-cut approach to physical mapping with end-probes. ACM. Working Paper.

D

Dörpinghaus, Jens (2018). Pseudostabile Mengen in Graphen. PhD thesis, Universität zu Köln.

Dressler, Daniel, Groß, Martin, Schlechter, Gordon, Schmidt, Melanie, Skutella, Martin, Temme, Sylvie, Kappmeier, Jan-Philipp W., Kelter, Timon, Kulbatzki, Joscha and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2010). On the Use of Network Flow Techniques for Assigning Evacuees to Exits. Procedia Engineering, 3. pp. 205-215. Elsevier.

Dahlhaus, Elias (2002). Minimal Elimination Ordering for Graphs of Bounded Degree. Discrete Applied Mathematics, 116 (1-2). pp. 127-143. Elsevier Science.

Dahlhaus, Elias (1999). An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable. Working Paper.

Dahlhaus, Elias (1999). Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. ["eprint_fieldopt_monograph_type_preprint" not defined].

Dahlhaus, Elias (1997). Minimal Elimination Ordering Inside a Given Chordal Graph. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Damm, Frank and Heider, Franz-Peter (1996). Amplifying the Security of One-Way Functions — A Proof of Yao's XOR-Lemma. Working Paper.

Damm, Frank, Heider, Franz-Peter and Wambach, Georg (1995). MIMD-Factorisation on Hypercubes. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Damm, Frank, Heider, Franz-Peter and Wambach, Georg (1994). Factoring Integers above 100 Digits using Hypercube MPQS. ["eprint_fieldopt_monograph_type_preprint" not defined].

E

Ebel, Patrick ORCID: 0000-0002-4437-2821 (2023). Data-Driven Evaluation of In-Vehicle Information Systems. PhD thesis, Universität zu Köln.

Ebel, Patrick ORCID: 0000-0002-4437-2821 (2023). Data-Driven Evaluation of In-Vehicle Information Systems: Supplementary Material.

Engels, Birgit and Schrader, Rainer (2015). Freight car dispatching with generalized flows. Networks, 66 (1). pp. 33-39. Wiley.

Esser, Alexander M. ORCID: 0000-0002-5974-2637 (2014). Kompaktierung orthogonaler Zeichnungen - Entwicklung und Analyse eines IP-basierten Algorithmus. Masters thesis, Universität zu Köln.

Engels, Birgit (2011). A Generalized Network Model for Freight Car Distribution. PhD thesis, Universität zu Köln.

Engels, Birgit (2010). The Transitive Minimum Manhattan Subnetwork Problem in 3 Dimensions. Discrete Applied Mathematics, 158 (4). pp. 298-307. Elsevier Science.

Engels, Birgit and Pardella, Gregor (2009). A Note on the Complexity of Sliding Shortest Paths. Working Paper.

Estrella-Balderrama, Alejandro, Gassner, Elisabeth, Jünger, Michael, Percan, Merijam, Schaefer, Marcus and Schulz, Michael (2008). Simultaneous Geometric Graph Embeddings. In: Graph drawing : 15th international symposium, GD 2007, Sydney, Australia, September 24 - 26, 2007 ; revised papers, pp. 280-290. Springer.

Eissfeldt, Nils Gustaf (2004). Vehicle-based modelling of traffic . Theory and application to environmental impact modelling. PhD thesis, Universität zu Köln.

Elf, Matthias, Jünger, Michael and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (2003). Minimizing Breaks by Maximizing Cuts. Operations Research Letters, 31 (5). pp. 343-349. Elsevier Science.

Eissfeldt, Nils and Schrader, Rainer (2002). Calculation of street traffic emissions with a queuing model. Vycislitel'nye technologii : zurnal = Computational technologies, 7 (8). pp. 5-15. Izdat. Sibirskogo Otdelenija Rossijskoj Akad..

Erdmann, Andreas, Nolte, Andreas, Noltemeier, Anja and Schrader, Rainer (2001). Modeling and Solving the Airline Schedule Generation Problem. Annals of Operations Research, 107 (1-4). pp. 117-141. Baltzer Science Publishers.

F

Fischbach, Jannik ORCID: 0000-0002-4361-6118 (2022). Why and How to Extract Conditional Statements From Natural Language Requirements. PhD thesis, Universität zu Köln.

Fischer, Greta (2021). Algorithmic Symplectic Packing. PhD thesis, Universität zu Köln.

Feld, Dustin (2017). FieldPlacer - A flexible, fast and unconstrained force-directed placement method for heterogeneous reconfigurable logic architectures. PhD thesis, Universität zu Köln.

Feld, Dustin, Soddemann, Thomas, Jünger, Michael and Mallach, Sven ORCID: 0000-0001-5335-0678 (2013). Facilitate SIMD-Code-Generation in the Polyhedral Model by Hardware-aware Automatic Code-Transformation. In: Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques, pp. 45-54.

Fanghänel, Diana and Liers, Frauke (2010). A Fast Exact Algorithm for the Problem of Optimum Cooperation and Structure of Its Solutions. Journal of Combinatorial Optimization, 19 (3). pp. 369-393. Springer Verlag.

Fowler, J. Joseph, Gutwenger, Carsten, Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X and Schulz, Michael (2009). An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. In: Graph Drawing GD 2008, pp. 157-168. Springer-Verlag.

Fanghänel, Diana and Liers, Frauke (2008). A Fast Exact Algorithm for the Optimum Cooperation Problem. Working Paper.

Fakler, Petra and Schrader, Rainer (2008). Ein verbandstheoretisches Modell zu Kreditausfallwahrscheinlichkeiten. Immobilien & Finanzierung - Der langfristige Kredit, 59 (7). pp. 257-259. Richardi.

Fowler, J. Joseph, Jünger, Michael, Kobourov, Stephen G. and Schulz, Michael (2008). Characterizing Simultaneous Embeddings with Fixed Edges. Electronic Notes in Discrete Mathematics, 31. pp. 41-44. Elsevier.

Fowler, J. Joseph, Jünger, Michael, Kobourov, Stephen G. and Schulz, Michael (2008). Characterizations of Restricted Pairs of Planar Graphs allowing Simultaneous Embeddings with Fixed Edges. In: Workshop on Graph-Theoretic Concepts in Computer Science 2008, pp. 146-158. Springer.

Fuchs, Bernhard (2007). On the Approximability of Range Assignment Problems. PhD thesis, Universität zu Köln.

G

Grinten, Alexander van der (2017). Design, implementation and evaluation of a distributed CDCL framework. PhD thesis, Universität zu Köln.

Gronemann, Martin ORCID: 0000-0003-2565-090X (2015). Algorithms for Incremental Planar Graph Drawing and Two-page Book Embeddings. PhD thesis, Universität zu Köln.

Gronemann, Martin ORCID: 0000-0003-2565-090X and Jünger, Michael (2013). Drawing Clustered Graphs as Topographic Maps. In: Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, pp. 426-438. Springer.

Gronemann, Martin ORCID: 0000-0003-2565-090X, Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X and Kriege, Nils (2013). MolMap - Visualizing Molecule Libraries as Topographic Maps. In: GRAPP & IVAPP 2013 : proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications ; Barcelona, Spain, 21 - 24 February, pp. 515-524. SciTePress.

Gronemann, Martin ORCID: 0000-0003-2565-090X, Jünger, Michael, Mallach, Sven ORCID: 0000-0001-5335-0678 and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2011). Towards shortest longest edges in orthogonal graph drawing. ["eprint_fieldopt_monograph_type_preprint" not defined].

Geveler, Markus, Ribbrock, Dirk, Mallach, Sven ORCID: 0000-0001-5335-0678 and Göddeke, Dominik (2011). A Simulation Suite for Lattice-Boltzmann based Real-Time CFD Applications Exploiting Multi-Level Parallelism on Modern Multi- and Many-Core Architectures. Journal of Computational Science, 2 (2). pp. 113-123. Elsevier.

Ghaddar, Bissan, Anjos, Miguel and Liers, Frauke (2007). A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem. Annals of Operations Research, 188 (1). pp. 155-174. Baltzer Science Publishers.

Gassner, Elisabeth, Jünger, Michael, Percan, Merijam, Schaefer, Marcus and Schulz, Michael (2006). Simultaneous Graph Embeddings with Fixed Edges. In: Graph-theoretic concepts in computer science : 32nd international workshop, WG 2006, Bergen, Norway, June 22 - 24, 2006 ; revised papers, pp. 325-335. Springer.

Gassner, Elisabeth and Percan, Merijam (2006). Maximum Planar Subgraph on Graphs not Contractive to K5 or K3,3. Working Paper.

Genc, Zülfükar (2003). Ein neuer Ansatz zur Fahrplanoptimierung im ÖPNV: Maximierung von zeitlichen Sicherheitabständen. PhD thesis, Universität zu Köln.

Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Jünger, Michael and Weiskircher, René (2003). Subgraph Induced Connectivity Augmentation. In: Graph-theoretic concepts in computer science : 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19 - 21, 2003 ; revised papers, pp. 261-272. Springer.

Gutwenger, Carsten, Jünger, Michael, Klein, Karsten, Kupke, Joachim, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (2003). A New Approach for Visualizing UML Class Diagrams. In: SoftVis '03 : ACM Symposium on Software Visualization ; San Diego, California, USA, June 11 - 13, 2003, pp. 179-188. ACM.

Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Weiskircher, René and Jünger, Michael (2002). Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract). In: Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, pp. 220-336. Springer.

Genc, Zuelfuekar and Speckenmeyer, Ewald (2001). Fahrplanoptimierung im ÖPNV. Working Paper.

Gawron, Christian ORCID: 0000-0001-7139-7920 (1998). Simulation-Based Traffic Assignment. Computing user equilibria in large street networks. PhD thesis, Universität zu Köln.

H

Hachul, Stefan and Jünger, Michael (2007). Large-Graph Layout Algorithms at Work: An Experimental Study. Journal of Graph Algorithms and Applications, 11 (21). pp. 345-369.

Hachul, Stefan and Jünger, Michael (2006). An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. In: Graph drawing : 13th international symposium, GD 2005, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Springer.

Hachul, Stefan and Jünger, Michael (2006). A Provably Fast Multipole Method. Working Paper.

Hachul, Stefan (2005). A Potential-Field-Based Multilevel Algorithm for Drawing Large Graphs. PhD thesis, Universität zu Köln.

Hachul, Stefan and Jünger, Michael (2005). Large-Graph Layout with the Fast Multipole Multilevel Method. Working Paper.

Hachul, Stefan and Jünger, Michael (2004). Drawing Large Graphs with a Potential -Field-Based Multilevel Algorithm. In: Graph drawing: 12th international symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004; revised selected papers, pp. 285-295. Springer.

Heusch, Peter, Meisgen, Frank and Speckenmeyer, Ewald (1997). CATS - Computer Aided Tram Scheduling. ["eprint_fieldopt_monograph_type_preprint" not defined].

Heusch, Peter (1995). The Complexity of the Falsifiability Problem for Pure Implicational Formulas. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

J

Jünger, Michael and Mallach, Sven ORCID: 0000-0001-5335-0678 (2013). Solving the Simple Offset Assignment Problem as a Traveling Salesman. In: M-SCOPES '13: Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems, pp. 31-39. ACM.

Jünger, Michael and Schulz, Michael (2009). Intersection Graphs in Simultaneous Embedding with Fixed Edges. Journal of Graph Algorithms and Applications, 13 (2). pp. 205-218. Brown University.

Jünger, Michael, Schulz, Michael and Zychowicz, Wojciech (2009). GEODUAL: Fun with Geometric Duality. Working Paper.

Jünger, Michael and Leipert, Sebastian (2002). Level Planar Embedding in Linear Time (Full Version). Journal of Graph Algorithms and Applications, 6 (1). pp. 67-113. Brown University.

Jünger, Michael, Leipert, Sebastian and Percan, Merijam (2002). Triangulating Clustered Graphs. Working Paper.

Jünger, Michael and Kaibel, Volker (2001). The QAP-Polytope and the Star-Transformation. Discrete Applied Mathematics, 111 (3). pp. 283-306. Elsevier.

Jünger, Michael and Kaibel, Volker (2001). Box-Inequalities for Quadratic Assignment Polytopes. Mathematical Programming : Series A, 91 (1). pp. 175-197. Springer.

Jünger, Michael and Reinelt, Gerhard (2001). Combinatorial Optimization and Integer Programming. Oxford: Eolss Publishers.

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (2001). Automatisches Layout von Diagrammen. OR news : das Magazin der GOR, 5 (12). pp. 5-12. Gesellschaft für Operations Research.

Jünger, Michael and Kaibel, Volker (2000). On the SQAP-Polytope. SIAM Journal on Optimization, 11 (2). pp. 444-463. SIAM.

Jünger, Michael, Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 and Thienel, Stefan (2000). Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica, 26 (1). pp. 172-195. Springer.

Jünger, Michael and Leipert, Sebastian (1999). Level Planar Embedding in linear Time (Extended Abstract). Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1999). Level Planarity Testing in Linear Time (Full Version). Working Paper.

Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X, Odenthal, Thomas and Scharbrodt, Mark (1998). The thickness of a minor-excluded class of graphs. Discrete Mathematics, 182 (1-3). pp. 169-176. Elsevier.

Jünger, Michael and Thienel, Stefan (1998). Introduction to ABACUS - A branch-and-cut System. Operations Research Letters, 22 (2-3). pp. 83-95. Elsevier.

Jünger, Michael and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (1998). Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States. Springer.

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1997). 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. Journal of Graph Algorithms and Applications, 1. pp. 1-25. Brown Univ..

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1997). Pitfalls of using PQ-trees in Automatic Graph Drawing. In: Graph drawing : 5th international symposium, GD '97, Rome, Italy, September 18 - 20, 1997 ; proceedings, pp. 193-204. Springer.

Jünger, Michael, Lee, Eva K., Mutzel, Petra ORCID: 0000-0001-7621-971X and Odenthal, Thomas (1997). A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Kaibel, Volker (1996). A Basic Study of the QAP-Polytope. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). On Computing a Maximal Planar Subgraph using PQ-Trees. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Rinaldi, Giovanni (1995). The Traveling Salesman Problem. Elsevier. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Reinelt, Gerhard and Thienel, Stefan (1995). Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. American Math. Soc. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1995). The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Thienel, Stefan (1994). Provably good solutions for the traveling salesman problem. Physica-Verl.. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X, Odenthal, Thomas and Scharbrodt, Mark (1994). The Thickness of Graphs without K5-Minors. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Kaibel, Volker and Thienel, Stefan (1994). Computing Delaunay-Triangulations in Manhatten and Maximum Metric. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1993). Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut. IPCO Conference. ["eprint_fieldopt_monograph_type_preprint" not defined].

K

Kuckertz, Patrick (2018). Ein personen- und aufgabengenauer Ansatz zur robusten Einsatzplanung von Flugpersonal mittels Optimierung und Simulation. PhD thesis, Universität zu Köln.

Kiparski, Ekkehart (2016). Ein Programm für die Parallelisierung dynamisch adaptiver Mehrgitterverfahren. PhD thesis, Universität zu Köln.

Kuckertz, Patrick, Ullrich, Oliver and Randerath, Hubert (2012). A simulation based approach on robust airline job pairing. Simulation Notes Europe, 22 (2). pp. 77-82. ARGESIM / ASIM Pub. TU Vienna/Austria..

Kuckertz, Patrick, Ullrich, Oliver, Linstädter, Anja and Speckenmeyer, Ewald (2011). Agent based modeling and simulation of a pastoral-nomadic land use system. Simulation Notes Europe, 21 (3-4). pp. 147-152. ARGESIM / ASIM Pub. TU Vienna/Austria..

Krumke, Sven, Räbiger, Dirk and Schrader, Rainer (2008). Semi-Preemptive Routing on Trees. Discrete Applied Mathematics, 156 (17). pp. 3298-3304. Elsevier Science.

Katzgraber, Helmut G., Liers, Frauke, Hartmann, Alexander K., Körner, Mathias, Hartmann, Alexander K. and Jünger, Michael (2005). Universality-class dependence of energy distributions in spin glasses. Physical Review B, 72 (9). 094421. APS.

Knab, Bernhard, Schrader, Rainer, Weber, Iris, Weinbrecht, Karin and Wichern, Bernd (1997). Mesoskopisches Simulationsmodell zur Kollektivfortschreibung. Working Paper.

Kaibel, Volker (1997). Polyhedral Combinatorics of QAPs with Less Objects than Locations (Extended Abstract). Working Paper.

L

Lüpsen, Haiko (2021). Varianzanalysen - Prüfen der Voraussetzungen und nichtparametrische Methoden sowie praktische Anwendungen mit R und SPSS, Version 4.3. Technical Report.

Lüpsen, Haiko (2019). Varianzanalysen - Prüfen der Voraussetzungen und nichtparametrische Methoden sowie praktische Anwendungen mit R und SPSS. Version 3.2. Technical Report.

Lüpsen, Haiko (2019). Multiple Mittelwertvergleiche - parametrisch und nichtparametrisch - sowie α-Adjustierungen mit praktischen Anwendungen mit R und SPSS. Version 2.0. Technical Report.

Lüpsen, Haiko (2018). Varianzanalysen - Prüfen der Voraussetzungen und nichtparametrische Methoden sowie praktische Anwendungen mit R und SPSS. Version 3.1. Technical Report.

Lückerath, Daniel (2017). Ein Simulationsmodell für Öffentlichen Personennahverkehr mit regelbasiertem Verkehrsmanagement. PhD thesis, Universität zu Köln.

Lüpsen, Haiko (2017). The Aligned Rank Transform and discrete Variables - a Warning. Communications in Statistics - Simulation and Computation. Taylor & Francis. ISSN 0361-0918

Lüpsen, Haiko (2017). Comparison of nonparametric analysis of variance methods - A Vote for van der Waerden. Communications in Statistics - Simulation and Computation, 30. pp. 1-30. Taylor & Francis.

Lüpsen, Haiko (2016). Varianzanalysen - Prüfen der Voraussetzungen und nichtparametrische Methoden sowie praktische Anwendungen mit R und SPSS. Version 2.0. Technical Report.

Lüpsen, Haiko (2016). The Lognormal Distribution and Nonparametric Anovas - a Dangerous Alliance. Technical Report.

Lüpsen, Haiko (2015). Varianzanalysen - Prüfen der Voraussetzungen und nichtparametrische Methoden sowie praktische Anwendungen mit R und SPSS. Version 1.1 (2.3.2015). Technical Report.

Lückerath, Daniel, Ullrich, Oliver, Kupicha, Aleksander and Speckenmeyer, Ewald (2014). Multi-depot multi-vehicle-type vehicle scheduling for Cologne's tram network. In: Proceedings of ASIM-Workshop STS/GMMS 2014, ASIM Mitteilungen, pp. 191-197. ARGESIM/ASIM Pub., TU Vienna/Austria, Scheible, J.; Bausch-Gall, I.; Deatcu, C. (Ed.).

Lüpsen, Haiko (2014). Multiple Mittelwertvergleiche - parametrisch und nichtparametrisch - sowie α-Adjustierungen mit praktischen Anwendungen mit R und SPSS. Technical Report.

Lückerath, Daniel, Ullrich, Oliver and Speckenmeyer, Ewald (2013). Applicability of rescheduling strategies in tram networks. In: Proceedings of ASIM-Treffen STS/GMMS 2013, ASIM-Mitteilungen, ARGESIM/ASIM Pub., TU Vienna/Austria. Reichardt, R. (Ed.).

Lückerath, Daniel, Ullrich, Oliver and Speckenmeyer, Ewald (2012). Modeling time table based tram traffic. Simulation Notes Europe, 22 (2). pp. 61-68. ARGESIM / ASIM Pub. TU Vienna/Austria.

Lückerath, Daniel (2012). Thoughts on restauration of regular tram operation. In: Proceedings of Sommertreffen Verkehrssimulation 2012, pp. 5-7. ARGESIM/ASIM Pub., TU Vienna/Austria. Ullrich, O.; Lückerath, D.(Ed.).

Liers, Frauke and Pardella, Gregor (2012). Partitioning planar graphs: a fast combinatorial approach for max-cut. Computational Optimization and Applications. pp. 323-344. Kluwer Acedemic Publishers.

Liers, Frauke and Pardella, Gregor (2011). Simplifying Maximum Flow Computations: the Effect of Shrinking and Good Initial Flows. Discrete Applied Mathematics, 159 (17). 2187 -2203. Elsevier Science.

Liers, Frauke, Nieberg, Tim and Pardella, Gregor (2011). Via Minimization in VLSI Chip Design - Application of a Planar Max-Cut Algorithm. Working Paper.

Liers, Frauke, Marinari, Enzo, Pagacz, Ulrike, Ricci-Tersenghi, Federico and Schmitz, Vera (2010). A Non-Disordered Glassy Model with a Tunable Interaction Range. Journal of Statistical Mechanics: Theory and Experiment, 2010 (5). L05003. IOPscience.

Lange, Thomas (2010). 10 Jahre FAI Projekt. Working Paper.

Liers, Frauke and Pardella, Gregor (2010). Preprocessing Maximum Flow Algorithms. Working Paper.

Lange, Niels (2009). Ein Alpha-Shape-basiertes Protein-Docking-Verfahren. PhD thesis, Universität zu Köln.

Lemaic, Mile and Speckenmeyer, Ewald (2009). Markov-Chain-Based Heuristics for the Minimum Feedback Vertex Set Problem. Working Paper.

Lemaic, Mile (2008). Markov-Chain-Based Heuristics for the Feedback Vertex Set Problem for Digraphs. PhD thesis, Universität zu Köln.

Liers, Frauke and Pardella, Gregor (2008). A simple MAX-CUT algorithm for planar graphs. ["eprint_fieldopt_monograph_type_preprint" not defined].

Liers, Frauke and Martin, Olivier C. (2007). Magnetic exponents of two-dimensional spin glasses. Physical Review B, 76 (6). 060405.

Liers, Frauke, Lukic, Jovanka, Marinari, Enzo, Pelissetto, Andrea and Vicari, Ettore (2007). Zero-temperature behavior of the random-anisotropy model in the strong-anisotropy limit. Physical Review B, 76 (17). p. 174423.

Liers, Frauke (2004). Contributions to Determining Exact Ground-States of Ising Spin-Glasses and to their Physics. PhD thesis, Universität zu Köln.

Liers, Frauke, Palassini, Matteo, Hartmann, Alexander K. and Jünger, Michael (2003). Ground state of the Bethe lattice spin glass and running time of an exact optimization algorithm. Physical Review B, 68 (9). 094406. American Physical Society.

Lange, Thomas, Rühmkorf, Jens and Gärtner, Mattias (1999). The fully automatic installation of a Linux cluster. Working Paper.

Leipert, Sebastian (1996). The Tree Interface — Version 1.0 User Manual. Documentation.

M

Mallach, Sven ORCID: 0000-0001-5335-0678 (2015). Exact Integer Programming Approaches to Sequential Instruction Scheduling and Offset Assignment. PhD thesis, Universität zu Köln.

Mallach, Sven ORCID: 0000-0001-5335-0678 and Gutwenger, Carsten (2011). Improved Scalability By Using Hardware-Aware Thread Affinities. In: Facing the Multicore-Challenge, pp. 29-41. Springer.

Meisgen, Frank (1997). Dynamic Load Balancing for Simulations of Biological Aging. International Journal of Modern Physics : C, Physics and computers, 8 (3). pp. 575-582. World Scientific.

Mehlhorn, Kurt and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica, 16 (2). pp. 233-242. Springer.

Mehlhorn, Kurt, Mutzel, Petra ORCID: 0000-0001-7621-971X and Näher, Stefan (1994). An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm. ["eprint_fieldopt_monograph_type_preprint" not defined].

Mutzel, Petra ORCID: 0000-0001-7621-971X (1992). A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test. ["eprint_fieldopt_monograph_type_preprint" not defined].

N

Neuhaus, Stefan (2009). Eigenschaften kleinster dominierender Mengen und Dominanzzahlen von Damengraphen. PhD thesis, Universität zu Köln.

Nolte, Andreas and Schrader, Rainer (2001). Simulated Annealing and Graph Colouring. Combinatorics, probability & computing, 10 (1). 29 -40. Cambridge Univ. Press.

Nolte, Andreas and Schrader, Rainer (2000). A Note on the Finite Time Behaviour of Simulated Annealing. Mathematics of operations research, 25 (3). pp. 476-484. Informs.

Nolte, Andreas and Schrader, Rainer (1999). Coloring in Sublinear Time. Working Paper.

P

Pudlitz, Florian ORCID: 0000-0002-0006-1853 (2021). Verknüpfung von Anforderungen und Systemausführungen mithilfe einer Multilevel Markup Language. PhD thesis, Universität zu Köln.

Porschen, Stefan, Schmidt, Tatjana, Speckenmeyer, Ewald and Wotzlaw, Andreas (2011). XSAT and NAE-SAT of linear CNF classes. Discrete Applied Mathematics, 167. pp. 1-14. Elsevier.

Petzold, Martin, Ullrich, Oliver and Speckenmeyer, Ewald (2011). Dynamic Distributed Simulation of DEVS Models on the OSGi Service Platform. In: 21. Symposium Simulationstechnik : ASIM 2011 ; Grundlagen, Methoden und Anwendungen in Modellbildung und Simulation ; 7. - 9. September 2011, ZHAW, Winterthur, Schweiz, Pabst Science Publ..

Pardella, Gregor and Liers, Frauke (2008). Exact Ground States of Large Two-Dimensional Planar Ising Spin Glasses. Physical Review E, 78 (5). 056705. American Physical Society.

Percan, Merijam (2007). Constrained Planarity and Augmentation Problems. PhD thesis, Universität zu Köln.

Porschen, Stefan (2007). On variable-weighted exact satisfiability problems. Annals of mathematics and artificial intelligence, 51 (1). pp. 27-54.

Porschen, Stefan and Speckenmeyer, Ewald (2007). Clause set structures and satisfiability. Working Paper.

Porschen, Stefan (2007). On rectangular covering problems. Working Paper.

Porschen, Stefan and Speckenmeyer, Ewald (2007). Algorithms for Variable-Weighted 2-SAT and Dual Problems. Working Paper.

Porschen, Stefan and Speckenmeyer, Ewald (2007). Clause Set Structures and Polynomial-Time SAT-Decidable Classes. Working Paper.

Porschen, Stefan, Speckenmeyer, Ewald and Zhao, Xishun (2006). Linear CNF formulas and satisfiability. Working Paper.

Palassini, Matteo, Liers, Frauke, Jünger, Michael and Young, A. Peter (2003). Low Energy Excitations in Spin Glasses from Exact Ground States. Physical Review B, 68 (6). 064413. American Physical Society.

Pipenbacher, Peter, Schliep, Alexander, Schneckener, Sebastian, Schönhuth, Alexander, Schomburg, Dietmar and Schrader, Rainer (2002). ProClust: Improved clustering of protein sequences with an extended graph-based approach. Bioinformatics, 18 (Sup. 2). S182-S191. Oxford University Press.

R

Räbiger, Dirk and Schrader, Rainer (2009). Semi-preemptive routing on a linear and circular track. Discrete Optimization, 6 (3). pp. 223-230. Elsevier.

Rahman, Syed Asad (2008). Pathway Hunter Tool (PHT) � A Platform for Metabolic Network Analysis and Potential Drug Targeting. PhD thesis, Universität zu Köln.

Räbiger, Dirk (2005). Semi-Präemptives Transportieren. PhD thesis, Universität zu Köln.

Räbiger, Dirk (2004). Semi-preemptive routing on a linear and circular track. Working Paper.

Randerath, Bert and Schiermeyer, Ingo (2004). Vertex colouring and forbidden subgraphs - a survey. Graphs and Combinatorics, 20 (1). pp. 1-40. Springer.

Rieger, Heiko, Santen, Ludger, Blasum, Ulrich, Diehl, Martin, Jünger, Michael and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (1996). The critical exponents of the two-dimensional Ising spin glass revisited: Exact Ground State Calculations and Monte Carlo Simulations. Journal of physics : A, Mathematical and general, 29 (14). pp. 3939-3950. IOP Publ..

S

Schwalb, Marcel (2019). Häufige Mustererkennung in sequenziellen Phasendatenbanken. Data-Mining und Prognoseerstellung am Beispiel von Bausparkollektiven. PhD thesis, Universität zu Köln.

Senger, Fabian Johannes (2018). On Equidomination in Graphs. PhD thesis, Universität zu Köln.

Schmidt, Daniel Rainer ORCID: 0000-0001-7381-912X (2014). Robust Design of Single-Commodity Networks. PhD thesis, Universität zu Köln.

Schaudt, Oliver, Schrader, Rainer and Weil, Vera (2013). On the separability of graphs. Discrete Mathematics, 313 (6). pp. 809-820. Elsevier.

Schaudt, Oliver (2012). On weighted efficient total domination. Journal of Discrete Algorithms, 10 (1). pp. 61-69. Elsevier.

Schaudt, Oliver (2011). A note on connected dominating sets of distance-hereditary graphs. Working Paper.

Schaudt, Oliver (2011). When the connected domination number is at most the total domination number. Working Paper.

Speckenmeyer, Ewald, Wotzlaw, Andreas and Porschen, Stefan (2011). A Satisfiability-based Approach for Embedding Generalized Tanglegrams on Level Graphs. In: Theory and Applications of Satisfiability Testing - SAT 2011 : 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, pp. 134-144. Springer.

Schaudt, Oliver (2011). Total domination versus paired domination. Working Paper.

Schaudt, Oliver (2011). On the existence of total dominating subgraphs with a prescribed additive hereditary property. Discrete Mathematics, 311 (18-19). pp. 2095-2101. Elsevier Science.

Schaudt, Oliver (2011). Efficient total domination in digraphs. Working Paper.

Schaudt, Oliver (2011). Paired and induced-paired domination in (E,net)-free graphs. Working Paper.

Schmidt, Tatjana (2010). Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas. PhD thesis, Universität zu Köln.

Schaudt, Oliver (2010). On efficient total domination. Working Paper.

Schaudt, Oliver and Schrader, Rainer (2010). The complexity of connected domination and total domination by restricted induced graphs. Working Paper.

Schaudt, Oliver (2010). A Graph Class related to the Structural Domination Problem. Working Paper.

Seifert, Thomas and Speckenmeyer, Ewald (1997). Optimal Oblivious Permutation Routing in Small Hypercubes. World Scientific. ["eprint_fieldopt_monograph_type_preprint" not defined].

Simone, Caterina De and Jünger, Michael (1997). On the Two-Connected Planar Spanning Subgraph Polytope. Discrete Applied Mathematics, 80 (2-3). pp. 223-229. Elsevier Science.

Speckenmeyer, Ewald, Böhm, Max and Heusch, Peter (1997). On the Imbalance of Distributions of Solutions of CNF-Formulas and its Impact on Satisfiability Solvers. Providence, RI: American Math. Soc.. ["eprint_fieldopt_monograph_type_preprint" not defined].

Schwikowski, B. and Speckenmeyer, Ewald (1997). On computing all minimal solutions for feedback problems. Working Paper.

Srivastav, Anand and Stangier, Peter (1996). Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming. Wiley. ["eprint_fieldopt_monograph_type_preprint" not defined].

Srivastav, Anand and Stangier, Peter (1995). Weighted Fractional and Integral k-Matching in Hypergraphs. Elsevier. ["eprint_fieldopt_monograph_type_preprint" not defined].

Simone, Caterina De, Diehl, Martin, Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X, Reinelt, Gerhard and Rinaldi, Giovanni (1995). Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm. Journal of statistical physics, 80 (1-2). pp. 487-496. Springer.

Störmer, Peter and Jünger, Michael (1995). Solving large-scale traveling salesman problems with parallel Branch-and-Cut. ["eprint_fieldopt_monograph_type_preprint" not defined].

Srivastav, Anand and Stangier, Peter (1994). Tight Approximation for Resource Constrained Scheduling and Bin Packing. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Srivastav, Anand and Stangier, Peter (1993). Integer Multicommodity Flows with Reduced Demands. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Srivastav, Anand and Stangier, Peter (1992). On Derandomized Approximation Algorithms. ["eprint_fieldopt_monograph_type_preprint" not defined].

T

Thienel, Stefan (1997). ABACUS - A Branch-And-CUt System, Version 2.0, User's Guide and Reference Manual. Documentation.

Thienel, Stefan (1996). A Simple TSP-Solver: An ABACUS Tutorial. Working Paper.

U

Ullrich, Oliver, Lückerath, Daniel and Speckenmeyer, Ewald (2015). A robust schedule for Montpellier's Tramway network. Simulation Notes Europe, 25 (1). pp. 1-8. ARGESIM/ASIM Pub..

Ullrich, Oliver, Lückerath, Daniel and Speckenmeyer, Ewald (2014). Reduzieren robuste Fahrpläne Verspätungen in Stadtbahnnetzen? - Es kommt drauf an! In: Heureka' 14 Optimierung in Verkehr und Transport, pp. 448-465. FGSV Verlag.

Ullrich, Oliver (2014). Modellbasierte Parallelisierung von Anwendungen zur Verkehrssimulation - Ein dynamischer und adaptiver Ansatz. PhD thesis, Universität zu Köln.

Ullrich, Oliver, Proff, Ingo, Lückerath, Daniel, Kuckertz, Patrick and Speckenmeyer, Ewald (2013). Agent-based modeling and simulation of individual traffic as an environment for bus schedule simulation. In: Proceedings of mobil,

Ullrich, Oliver, Lückerath, Daniel, Franz, Sebastian and Speckenmeyer, Ewald (2012). Simulation and optimization of Cologne's tram schedule. Simulation Notes Europe, 22 (2). pp. 69-76. ARGESIM / ASIM Pub. TU Vienna/Austria.

Ullrich, Oliver and Lückerath, Daniel (2012). Sommertreffen Verkehrssimulation 2012. ARGESIM/ASIM Pub., TU Vienna/Austria. Ullrich, O.; Lückerath, D.(Ed.).

V

van der Grinten, Alexander, Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). satUZK: Solver Description. In: Proceedings of SAT Challenge 2012 : Solver and Benchmark Descriptions, pp. 54-55. University of Helsinki.

van Dyk, Danny, Geveler, Markus, Mallach, Sven ORCID: 0000-0001-5335-0678, Ribbrock, Dirk, Göddeke, Dominik and Gutwenger, Carsten (2009). HONEI: A collection of libraries for numerical computations targeting multiple processor architectures. Computer Physics Communications, 180 (12). pp. 2534-2543. Elsevier.

W

Winkler, Jonas Paul (2021). Klassifikation von Anforderungen und Informationen zur Unterstützung von Qualitätssicherungsprozessen. PhD thesis, Universität zu Köln.

Wotzlaw, Andreas, van der Grinten, Alexander and Speckenmeyer, Ewald (2013). Effectiveness of pre- and inprocessing for CDCL-based SAT solving. Technical Report.

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). A Satisfiability-based Approach for Generalized Tanglegrams on Level Graphs. In: Dagstuhl Seminar ”SAT Interactions”, 18. - 23.11.2012, Dagstuhl. Speech. (["eprint_fieldopt_ispublished_unpub" not defined])

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). Probabilistic Analysis of Random Mixed Horn Formulas. Working Paper.

Wotzlaw, Andreas, Speckenmeyer, Ewald and Porschen, Stefan (2012). Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Discrete Applied Mathematics, 160 (16-17). pp. 2349-2363. Elsevier.

Wotzlaw, Andreas, van der Grinten, Alexander, Speckenmeyer, Ewald and Porschen, Stefan (2012). pfolioUZK: Solver Description. In: Proceedings of SAT Challenge 2012 : Solver and Benchmark Descriptions, p. 45. University of Helsinki.

Werth, Felix and Ullrich, Oliver (2011). Simulation ausgewählter Heuristiken zur Tourenplanung in manuellen Kommissionierstationen. In: Tagungsband / ASIM-Konferenz STS GMMS 2011 : 24. bis 25. Februar 2011 in Krefeld, pp. 161-166. Shaker Verlag.

Werth, Felix, Ullrich, Oliver and Speckenmeyer, Ewald (2011). Reducing blocking effects in multi-block layouts. In: 21. Symposium Simulationstechnik : ASIM 2011 ; Grundlagen, Methoden und Anwendungen in Modellbildung und Simulation ; 7. - 9. September 2011, ZHAW, Winterthur, Schweiz, Pabst Science Publ..

Werth, Felix, Beckers, Martin, Ullrich, Oliver and Speckenmeyer, Ewald (2010). Simulation zur Verbesserung der Logistikprozesse eines Pharmagroßhandels. In: Integrationsaspekte der Simulation: Technik, Organisation und Personal, pp. 261-268. Karlsruhe: KIT Scientific Publishing.

Wambach, Georg and Wettig, Hannes (1995). Block Sieving Algorithms. ["eprint_fieldopt_monograph_type_preprint" not defined].

Wambach, Georg (1993). The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255. ["eprint_fieldopt_monograph_type_preprint" not defined].

Z

Zellmann, Stefan (2014). Interactive High Performance Volume Rendering. PhD thesis, Universität zu Köln.

Ziegelmayer, Dominique and Schrader, Rainer (2013). Sentiment classification using statistical data compression models. In: IEEE 12th International Conference on Data Mining workshops (ICDMW 2012), pp. 731-738. IEEE.

Á

Álvarez-Miranda, Eduardo, Cacchiani, Valentina, Lodi, Andrea, Parriani, Tiziano and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2014). Single-commodity robust network design problem: Complexity, instances and heuristic solutions. European Journal of Operational Research, 238 (3). pp. 711-723. Elsevier.

Álvarez-Miranda, Eduardo, Liers, Frauke, Lodi, Andrea, Parriani, Tiziano, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X, Cacchiani, Valentina, Dorneth, Tim and Jünger, Michael (2012). Models and Algorithms for Robust Network Design with Several Traffic Scenarios. In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, pp. 261-272. Springer-Verlag.