Technische Universität München
Technische Universität München

Publications

2018

  • Fitch, Katherine: Metric preserving directed graph symmetrization. CoRR abs/1802.09829, 2018 more… BibTeX
  • Fürst, Maximilian; Leichter, Marilena; Rautenbach, Dieter: Locally searching for large induced matchings. Theoretical Computer Science, 2018 more… BibTeX
  • Giannakopoulos, Yiannis; Koutsoupias, Elias: Duality and Optimality of Auctions for Uniform Distributions. SIAM Journal on Computing 47 (1), 2018, 121-165 more… BibTeX
  • Gottschau, Marinus; Heydenreich, Markus; Matzke, Kilian; Toninelli, Cristina: Phase Transition for a Non-Attractive Infection Process in Heterogeneous Environment. Markov Processes Relat. Fields 24 (1), 2018, 39--56 more… BibTeX

2017

  • Ambaram, Tânia; Beggs, Edwin; Félix Costa, José; Poças, Diogo; Tucker, John V.: An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles. In: Adamatzky, Andrew (Ed.): Advances in Unconventional Computing: Volume 1: Theory. Springer International Publishing, 2017, 73--115 more… BibTeX
  • Beggs, Edwin; Costa, José Félix; Poças, Diogo; Tucker, John V.: Computations with oracles that measure vanishing quantities. Mathematical Structures in Computer Science 27 (8), 2017, 1315--1363 more… BibTeX
  • Borgwardt, Steffen; Happach, Felix: Good Clusterings Have Large Volume. ArXiv e-prints, 2017 more… BibTeX
  • Büsing, Christina; Goetzmann, Kai-Simon; Matuschke, Jannik; Stiller, Sebastian: Reference Points and Approximation Algorithms in Multicriteria Discrete Optimization. European Journal of Operational Research 260 (3), 2017, 829-840 more… BibTeX
  • Correa, José R.; Harks, Tobias; Kreuzen, Vincent J.C.; Matuschke, Jannik: Fare evasion in transit networks. Operations Research 65 (1), 2017, 165-183 more… BibTeX
  • Costa, José Félix; Poças, Diogo: Solving Smullyan Puzzles with Formal Systems. Axiomathes, 2017 more… BibTeX
  • Giannakopoulos, Yiannis; Koutsoupias, Elias; Lazos, Philip: Online Market Intermediation. 44th International Colloquium on Automata, Languages, and Programming (ICALP 1́7) (Leibniz International Proceedings in Informatics (LIPIcs)), 2017Full version in CoRR: abs/1703.09279 more… BibTeX
  • Giannakopoulos, Yiannis; Kyropoulou, Maria: The VCG Mechanism for Bayesian Scheduling. ACM Trans. Econ. Comput. (TEAC) 5 (4), 2017, 19:1--19:16 more… BibTeX
  • Gottschau, Marinus; Haverkort, Herman; Matzke, Kilian: Reptilings and space-filling curves for acute triangles. Discrete & Computational Geometry, 2017, 1--30 more… BibTeX
  • Happach, Felix: Stabile Clusterings und die äußeren Normalenkegel. OR News 61, 2017, 11-13 more… BibTeX
  • Happach, Felix: Stable Clusterings and the Cones of Outer Normals. Selected Papers of the International Conference on Operations Research (OR 2017), 2017Berlin, Germany more… BibTeX
  • Křetínský, Jan; Meggendorfer, Tobias; Waldmann, Clara; Weininger, Maximilian: Index Appearance Record for Transforming Rabin Automata into Parity Automata. In: Legay, Axel; Margaria, Tiziana (Ed.): Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part I. Springer Berlin Heidelberg, 2017, 443--460 more… BibTeX
  • Matuschke, Jannik; McCormick, S. Thomas; Oriolo, Gianpaolo; Peis, Britta; Skutella, Martin: Protection of flows under targeted attacks. Operations Research Letters 45 (1), 2017, 53--59 more… BibTeX
  • Pace, N.; Sonnino, A.: On linear codes admitting large automorphism groups. Designs, Codes and Cryptography 83 (1), 2017, 115--143 more… BibTeX
  • Poças, Diogo; Protas, Bartosz: Transient growth in stochastic Burgers flows. Discrete & Continuous Dynamical Systems - B 22, 2017, 1 more… BibTeX
  • Poças, Diogo; Zucker, Jeffery: Analog networks on function data streams. Computability, 2017, 1--22 more… BibTeX

2016

  • Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David; Matuschke, Jannik: Matchings with lower quotas: Algorithms and complexity. Algorithmica, 2016 more… BibTeX
  • Disser, Yann; Matuschke, Jannik: Degree-constrained orientations of embedded graphs. Journal of Combinatorial Optimization 31 (2), 2016, 758--773 more… BibTeX
  • Dutour Sikirić, Mathieu and Garber, Alexey and Schürmann, Achill and Waldmann, Clara: The complete classification of five-dimensional Dirichlet - Voronoi polyhedra of translational lattices. Acta Crystallographica Section A 72 (6), 2016, 673--683 more… BibTeX
  • Fitch, K.; Leonard, N. E.: Joint centrality distinguishes optimal leaders in noisy networks. IEEE Transactions on Control of Network Systems 3 (4), 2016, 366-378 more… BibTeX
  • Fitch, K.; Leonard, N. E.: Optimal leader selection for controllability and robustness in multi-agent networks. Proc. European Control Conference, 2016Aalborg, Dänemark more… BibTeX
  • Giannakopoulos, Yiannis; Koutsoupias, Elias; Kyropoulou, Maria: The Anarchy of Scheduling Without Money. Algorithmic Game Theory: 9th International Symposium (SAGT 1́6), Springer Berlin Heidelberg, 2016Liverpool, UK more… BibTeX
  • Harks, Tobias; König, Felix G.; Matuschke, Jannik; Richter, Alexander; Schulz, Jens: An Integrated Approach to Tactical Transportation Planning in Logistics Networks. Transportation Science 50 (2), 2016, 439--460 more… BibTeX
  • Orlin, James B.; Schulz, Andreas S.; Udwani, Rajan: Robust Monotone Submodular Function Maximization. Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings, 2016Liège, Belgium more… BibTeX
  • Poças, Diogo; Zucker, Jeffery: Fixed Point Techniques in Analog Systems. Mathematical and Computational Approaches in Advancing Modern Science and Engineering, Springer International Publishing, 2016Waterloo, Canada more… BibTeX
  • Schulz, Andreas S.; Verschae, José: Min-Sum Scheduling Under Precedence Constraints. 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, 2016Aarhus, Denmark more… BibTeX

2015

  • Schulz, Andreas S.; Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea (Ed.): Gems of Combinatorial Optimization and Graph Algorithms. Springer, 2015 more… BibTeX
  • Correa, José R.; Marchetti-Spaccamela, Alberto; Matuschke, Jannik; Stougie, Leen; Svensson, Ola; Verdugo, Víctor; Verschae, José: Strong LP formulations for scheduling splittable jobs on unrelated machines. Mathematical Programming 154 (1--2), 2015, 305--328 more… BibTeX
  • Giannakopoulos, Yiannis: Mechanism Design and Strong Truthfulness – 8. In: Laud, Peeter; Kamm, Liina (Ed.): Applications of Secure Multiparty Computation. IOS Press, 2015, 150--164 more… BibTeX
  • Giannakopoulos, Yiannis: Bounding the Optimal Revenue of Selling Multiple Goods. Theoretical Computer Science 581 (0), 2015, 83--96 more… BibTeX
  • Giannakopoulos, Yiannis; Koutsoupias, Elias: Selling Two Goods Optimally. In: Halldórsson, Magnús M; Iwama, Kazuo; Kobayashi, Naoki; Speckmann, Bettina (Ed.): Automata, Languages, and Programming (ICALP 1́5). Springer Berlin Heidelberg, 2015, 650--662 more… BibTeX
  • Giannakopoulos, Yiannis; Koutsoupias, Elias: Competitive Analysis of Maintaining Frequent Items of a Stream. Theoretical Computer Science 562 (0), 2015, 23--32 more… BibTeX
  • Giannakopoulos, Yiannis; Kyropoulou, Maria: The VCG Mechanism for Bayesian Scheduling. In: Markakis, Evangelos; Schäfer, Guido (Ed.): Web and Internet Economics. Springer Berlin Heidelberg, 2015, 343--356 more… BibTeX
  • Korchmáros, Gábor; Nagy, Gábor P.; Pace, Nicola: k-nets embedded in a projective plane over a field. Combinatorica 35 (1), 2015, 63--74 more… BibTeX
  • Matuschke, Jannik; Skutella, Martin; Soto, José A.: Robust Randomized Matchings. Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), SIAM, 2015San Diego, California, USA more… BibTeX
  • Orlin, James B.; Schulz, Andreas S.; Udwani, Rajan: Robust Monotone Submodular Function Maximization. CoRR abs/1507.06616, 2015 more… BibTeX
  • Schulz, Andreas S.: Selfish Routing and Proportional Resource Allocation. In: Gems of Combinatorial Optimization and Graph Algorithms. Springer, 2015, 95--102 more… BibTeX

2014

  • Schulz, Andreas S.;Wagner, Dorothea: Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. . (Lecture Notes in Computer Science) Springer, 2014 more… BibTeX
  • Beggs, Edwin; Costa, José Félix; Poças, Diogo; Tucker, John V.: An Analogue-digital Church-Turing Thesis. International Journal of Foundations of Computer Science 25 (04), 2014, 373--389 more… BibTeX
  • Chavan, R. A.; Fitch, K.; Palanthandalam-Madapusi, H. J.: Recursive input reconstruction with a delay. Proc. American Control Conference, 2014Portland, OR, USA more… BibTeX
  • Giannakopoulos, Yiannis: A Note on Selling Optimally Two Uniformly Distributed Goods. CoRR abs/1409.6, 2014 more… BibTeX
  • Giannakopoulos, Yiannis; Koutsoupias, Elias: Duality and Optimality of Auctions for Uniform Distributions. Proceedings of the 15th ACM Conference on Economics and Computation (EC 1́4), 2014Palo Alto, California, USA more… BibTeX
  • Kappmeier, Jan-Philipp W.; Matuschke, Jannik; Peis, Britta: Abstract flows over time: A first step towards solving dynamic packing problems. Theoretical Computer Science 544, 2014, 74--83 more… BibTeX
  • Korchmáros, Gábor; Nagy, Gábor P.; Pace, Nicola: 3-nets realizing a group in a projective plane. J. Algebraic Combin. 39 (4), 2014, 939--966 more… BibTeX
  • Korchmáros, Gábor; Pace, Nicola: Coset intersection of irreducible plane cubics. Des. Codes Cryptogr. 72 (1), 2014, 53--75 more… BibTeX
  • Leonard, Naomi E; Young, George F; Hochgraf, Kelsey; Swain, Daniel T; Trippe, Aaron; Chen, Willa; Fitch, Katherine; Marshall, Susan: In the Dance Studio: An Art and Engineering Exploration of Human Flocking – In the Dance Studio: An Art and Engineering Exploration of Human Flocking. In: Controls and Art. Springer International Publishing, 2014, 27-49 more… BibTeX
  • Manzoni, Luca; Poças, Diogo; Porreca, Antonio E.: Simple Reaction Systems And Their Classification. International Journal of Foundations of Computer Science 25 (04), 2014, 441--457 more… BibTeX
  • Matuschke, Jannik: Mathematischer Modellbau. Bild der Wissenschaft plus (Klartext!-Sonderbeilage), 2014, 28-31 more… BibTeX
  • Mittal, Shashi; Schulz, Andreas S.; Stiller, Sebastian: Robust appointment scheduling. APPROX/RANDOM 2014, 2014Pages 356-370 in Klaus Jansen et al. (eds.), Approximation, Randomization, and Combinatorial Optimization — Algorithms and Techniques, APPROX/RANDOM 2014, LIPIcs 28, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Pages 356-370 more… BibTeX
  • Pace, N.: New ternary linear codes from projectivity groups. Discrete Math. 331, 2014, 22--26 more… BibTeX
  • Pace, N.: On small complete arcs and transitive A_5-invariant arcs in the projective plane PG(2,q). J. Combin. Des. 22 (10), 2014, 425--434 more… BibTeX

2013

  • Beggs, Edwin; Costa, José Félix; Poças, Diogo; Tucker, John V.: Oracles that measure thresholds: the Turing machine and the broken balance. Journal of Logic and Computation 23 (6), 2013, 1155--1181 more… BibTeX
  • Beggs, Edwin; Costa, José Félix; Poças, Diogo; Tucker, John V.: On the Power of Threshold Measurements as Oracles. Unconventional Computation and Natural Computation, Springer Berlin Heidelberg, 2013Milan, Italy more… BibTeX
  • Correa, José R.; Schulz, Andreas S.; Stier-Moses, Nicolás E.: The Price of Anarchy of the Proportional Allocation Mechanism Revisited. Web and Internet Economics - 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings, 2013Cambridge, MA, USA more… BibTeX
  • Cseh, Ágnes; Matuschke, Jannik; Skutella, Martin: Stable flows over time. Algorithms 6 (3), 2013, 532--545 more… BibTeX
  • Dunkel, Juliane; Schulz, Andreas S.: The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope. Math. Oper. Res. 38 (1), 2013, 63--91 more… BibTeX
  • Fitch, K.; Leonard, N. E.: Information centrality and optimal leader selection in noisy networks. Proc. IEEE Conference on Decision and Control, 2013Florenz, Italien more… BibTeX
  • Harks, Tobias; König, Felix G.; Matuschke, Jannik: Approximation Algorithms for Capacitated Location Routing. Transportation Science 47 (1), 2013, 3-22 more… BibTeX
  • Matuschke, Jannik; Bley, Andreas; Müller, Benjamin: Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. In: Algorithms---ESA 2013. Springer, 2013, 707-718 more… BibTeX
  • Mittal, Shashi; Schulz, Andreas S.: An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. 141 (1-2), 2013, 103--120 more… BibTeX
  • Mittal, Shashi; Schulz, Andreas S.: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. Operations Research 61 (2), 2013, 386--397 more… BibTeX
  • Nagy, Gábor P.; Pace, Nicola: On small 3-nets embedded in a projective plane over a field. J. Combin. Theory Ser. A 120 (7), 2013, 1632--1641 more… BibTeX
  • Schulz, Andreas S.; Uhan, Nelson A.: Approximating the least core value and least core of cooperative games with supermodular costs. Discrete Optimization 10 (2), 2013, 163--180 more… BibTeX

2012

  • Giannakopoulos, Yiannis; Koutsoupias, Elias: Competitive Analysis of Maintaining Frequent Items of a Stream. In: Fomin, Fedor V; Kaski, Petteri (Ed.): Algorithm Theory -- SWAT 2012. Springer Berlin Heidelberg, 2012, 340--351 more… BibTeX
  • Ilić, Ivana; Pace, Nicola; Magliveras, Spyros S.: Decomposing the Higman-Sims graph into double Petersen graphs. J. Combin. Math. Combin. Comput. 80, 2012, 267--275 more… BibTeX
  • Kolotoglu, Emre; Pace, Nicola; Magliveras, Spyros S.: Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs. Australas. J. Combin. 54, 2012, 217--230 more… BibTeX
  • König, Felix G.; Matuschke, Jannik; Richter, Alexander: Multi-Dimensional Commodity Covering for Tariff Selection in Transportation. In: 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2012). Dagstuhl Publishing, 2012, 58--70 more… BibTeX
  • Meyers, Carol A.; Schulz, Andreas S.: The complexity of welfare maximization in congestion games. Networks 59 (2), 2012, 252--260 more… BibTeX
  • Pace, Nicola: Coset intersection problem and application to 3-nets. , 2012 more… BibTeX

2011

  • Becchetti, Luca; Chatzigiannakis, Ioannis; Giannakopoulos, Yiannis: Streaming techniques and data aggregation in networks of tiny artefacts. Computer Science Review 5 (1), 2011, 27--46 more… BibTeX
  • Dunkel, Juliane; Schulz, Andreas S.: The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope. Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, 2011Zurich, Switzerland more… BibTeX
  • Fitch, K.; Palanthandalam-Madapusi, H. J.: Unbiased minimum-variance filtering for delayed input reconstruction. Proc. American Control Conference, 2011San Francisco, Kalifornien, USA more… BibTeX
  • Giannakopoulos, Yiannis; Koninis, Christos: Data Aggregation – 5. In: Chatzigiannakis, Ioannis; Spirakis, Paul (Ed.): Distributed Self-organized Societies of Tiny Artefacts: Design & Implementation. Lulu Publishers, 2011 more… BibTeX
  • Letchford, Adam N.; Pokutta, Sebastian; Schulz, Andreas S.: On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39 (5), 2011, 301--304 more… BibTeX
  • Pace, Nicola: On the distribution of the elements of a finite group generated by covers. Appl. Algebra Engrg. Comm. Comput. 22 (5-6), 2011, 367--373 more… BibTeX
  • Pokutta, Sebastian; Schulz, Andreas S.: Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank. Oper. Res. Lett. 39 (6), 2011, 457--460 more… BibTeX
  • Schulz, Andreas S.; Telha, Claudio: Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings, 2011Saarbrücken, Germany more… BibTeX
  • Schulz, Andreas S.; Uhan, Nelson A.: Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling. Math. Oper. Res. 36 (1), 2011, 14--23 more… BibTeX

2010

  • Korchmáros, G.; Pace, N.: Infinite family of large complete arcs in m PG(2,q^n), with q odd and n>1 odd. Des. Codes Cryptogr. 55 (2-3), 2010, 285--296 more… BibTeX
  • Mastrolilli, Monaldo; Queyranne, Maurice; Schulz, Andreas S.; Svensson, Ola; Uhan, Nelson A.: Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38 (5), 2010, 390--395 more… BibTeX
  • Matuschke, Jannik; Peis, Britta: Lattices and maximum flow algorithms in planar graphs. In: Graph-Theoretic Concepts in Computer Science (WG 2010). Springer, 2010, 324--335 more… BibTeX
  • Pokutta, Sebastian; Schulz, Andreas S.: On the Rank of Cutting-Plane Proof Systems. Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings, 2010Lausanne, Switzerland more… BibTeX
  • Schulz, Andreas S.; Uhan, Nelson A.: Sharing Supermodular Costs. Operations Research 58 (4-Part-2), 2010, 1051--1056 more… BibTeX

2009

  • Immorlica, Nicole; Li, Li (Erran); Mirrokni, Vahab S.; Schulz, Andreas S.: Coordination mechanisms for selfish scheduling. Theor. Comput. Sci. 410 (17), 2009, 1589--1598 more… BibTeX
  • Meyers, Carol A.; Schulz, Andreas S.: Integer equal flows. Oper. Res. Lett. 37 (4), 2009, 245--249 more… BibTeX
  • Orlin, James B.; Punnen, Abraham P.; Schulz, Andreas S.: Integer Programming: Optimization and Evaluation Are Equivalent. Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, 2009Banff, Canada more… BibTeX
  • Schulz, Andreas S.; Uhan, Nelson A.: Sharing Supermodular Costs. Models and Algorithms for Optimization in Logistics, 21.06. - 26.06.2009, 2009Dagstuhl, Germany more… BibTeX

2008

  • Bǒzović, Vladimir; Pace, Nicola: On group factorizations using free mappings. J. Algebra Appl. 7 (5), 2008, 647--662 more… BibTeX
  • Correa, José R.; Schulz, Andreas S.; Stier-Moses, Nicolás E.: A geometric approach to the price of anarchy in nonatomic congestion games. Games and Economic Behavior 64 (2), 2008, 457--469 more… BibTeX
  • Dunkel, Juliane; Schulz, Andreas S.: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. Math. Oper. Res. 33 (4), 2008, 851--868 more… BibTeX
  • Mittal, Shashi; Schulz, Andreas S.: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, 2008Boston, MA, USA more… BibTeX
  • Orlin, James B.; Schulz, Andreas S.; Sengupta, Sudipta: epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems. Discrete Optimization 5 (2), 2008, 550--561 more… BibTeX
  • Schulz, Andreas S.: On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming. Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany, 2008Bonn, Germany more… BibTeX
  • Schulz, Andreas S.: Stochastic Online Scheduling Revisited. Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, 2008St. John's, NL, Canada more… BibTeX

2007

  • Correa, José R.; Schulz, Andreas S.; Stier-Moses, Nicolás E.: Fast, Fair, and Efficient Flows in Networks. Operations Research 55 (2), 2007, 215--225 more… BibTeX
  • Schulz, Andreas S.; Uhan, Nelson A.: Encouraging Cooperation in Sharing Supermodular Costs. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, 2007Princeton, NJ, USA more… BibTeX

2006

  • Dunkel, Juliane; Schulz, Andreas S.: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings, 2006Patras, Greece more… BibTeX
  • Queyranne, Maurice; Schulz, Andreas S.: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. SIAM J. Comput. 35 (5), 2006, 1241--1253 more… BibTeX
  • Schulz, Andreas S.; Stier-Moses, Nicolás E.: Efficiency and fairness of system-optimal routing with user constraints. Networks 48 (4), 2006, 223--234 more… BibTeX

2005

  • Correa, José R.; Schulz, Andreas S.: Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 30 (4), 2005, 1005--1021 more… BibTeX
  • Correa, José R.; Schulz, Andreas S.; Stier-Moses, Nicolás E.: On the Inefficiency of Equilibria in Congestion Games. Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, 2005Berlin, Germany more… BibTeX
  • Immorlica, Nicole; Li, Erran L.; Mirrokni, Vahab S.; Schulz, Andreas S.: Coordination Mechanisms for Selfish Scheduling. Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings, 2005Hong Kong, China more… BibTeX
  • Jahn, Olaf; Möhring, Rolf H.; Schulz, Andreas S.; Stier-Moses, Nicolás E.: System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion. Operations Research 53 (4), 2005, 600--616 more… BibTeX
  • Schulz, Andreas S.: New Old Algorithms for Stochastic Scheduling. Algorithms for Optimization with Incomplete Information, 16.-21. January 2005, 2005Dagstuhl, Germany more… BibTeX

2004

  • Baptiste, Philippe; Carlier, Jacques; Munier, Alix; Schulz, Andreas S.: Introduction. Annals OR 129 (1-4), 2004, 17--19 more… BibTeX
  • Correa, José R.; Schulz, Andreas S.: Single Machine Scheduling with Precedence Constraints: Extended Abstract. Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, 2004New York, NY, USA more… BibTeX
  • Correa, José R.; Schulz, Andreas S.; Stier-Moses, Nicolás E.: Selfish Routing in Capacitated Networks. Math. Oper. Res. 29 (4), 2004, 961--976 more… BibTeX
  • Correa, José R.; Schulz, Andreas S.; Stier-Moses, Nicolás E.: Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, 2004New York, NY, USA more… BibTeX
  • Megow, Nicole; Schulz, Andreas S.: On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. 32 (5), 2004, 485--490 more… BibTeX
  • Orlin, James B.; Punnen, Abraham P.; Schulz, Andreas S.: Approximate Local Search in Combinatorial Optimization. SIAM J. Comput. 33 (5), 2004, 1201--1214 more… BibTeX
  • Orlin, James B.; Punnen, Abraham P.; Schulz, Andreas S.: Approximate local search in combinatorial optimization. Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, 2004New Orleans, Louisiana, USA more… BibTeX

2003

  • Eisenbrand, Friedrich; Schulz, Andreas S.: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. Combinatorica 23 (2), 2003, 245--261 more… BibTeX
  • Megow, Nicole; Schulz, Andreas S.: Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers, 2003Budapest, Hungary more… BibTeX
  • Möhring, Rolf H.; Schulz, Andreas S.; Stork, Frederik; Uetz, Marc: Solving Project Scheduling Problems by Minimum Cut Computations. Management Science 49 (3), 2003, 330--350 more… BibTeX
  • Schulz, Andreas S.; Stier-Moses, Nicolás E.: On the performance of user equilibria in traffic networks. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., 2003Baltimore, Maryland, USA more… BibTeX

2002

  • Cook, William J.;Schulz, Andreas S.: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings. . (Lecture Notes in Computer Science) Springer, 2002 more… BibTeX
  • Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang: Single Machine Scheduling with Release Dates. SIAM J. Discrete Math. 15 (2), 2002, 165--192 more… BibTeX
  • Müller, Rudolf; Schulz, Andreas S.: Transitive Packing: A Unifying Concept in Combinatorial Optimization. SIAM Journal on Optimization 13 (2), 2002, 335--367 more… BibTeX
  • Schulz, Andreas S.; Skutella, Martin: Scheduling Unrelated Machines by Randomized Rounding. SIAM J. Discrete Math. 15 (4), 2002, 450--469 more… BibTeX
  • Schulz, Andreas S.; Weismantel, Robert: The Complexity of Generic Primal Algorithms for Solving General Integer Programs. Math. Oper. Res. 27 (4), 2002, 681--692 more… BibTeX

2001

  • Möhring, Rolf H.; Schulz, Andreas S.; Stork, Frederik; Uetz, Marc: On project scheduling with irregular starting time costs. Oper. Res. Lett. 28 (4), 2001, 149--154 more… BibTeX

2000

  • Orlin, James B.; Schulz, Andreas S.; Sengupta, Sudipta: epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, 2000Portland, OR, USA more… BibTeX

1999

  • Bockmayr, Alexander; Eisenbrand, Friedrich; Hartmann, Mark E.; Schulz, Andreas S.: On the Chvátal Rank of Polytopes in the 0/1 Cube. Discrete Applied Mathematics 98 (1-2), 1999, 21--27 more… BibTeX
  • Eisenbrand, Friedrich; Schulz, Andreas S.: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, 1999Graz, Austria more… BibTeX
  • Möhring, Rolf H.; Schulz, Andreas S.; Stork, Frederik; Uetz, Marc: Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, 1999Prague, Czech Republic more… BibTeX
  • Möhring, Rolf H.; Schulz, Andreas S.; Uetz, Marc: Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46 (6), 1999, 924--942 more… BibTeX
  • Möhring, Rolf H.; Schulz, Andreas S.; Uetz, Marc: Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings, 1999Berkeley, CA, USA more… BibTeX
  • Schulz, Andreas S.; Weismantel, Robert: An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland., 1999Baltimore, Maryland, USA more… BibTeX

1998

  • Hartmann, Stephan; Schäffter, Markus W.; Schulz, Andreas S.: Switchbox Routing in VLSI Design: Closing the Complexity Gap. Theor. Comput. Sci. 203 (1), 1998, 31--49 more… BibTeX
  • Munier, Alix; Queyranne, Maurice; Schulz, Andreas S.: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, 1998Houston, Texas, USA more… BibTeX
  • Phillips, Cynthia A.; Schulz, Andreas S.; Shmoys, David B.; Stein, Clifford; Wein, Joel: Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. 1 (4), 1998, 413--426 more… BibTeX
  • Schrader, Rainer; Schulz, Andreas S.; Wambach, Georg: Base polytopes of series-parallel posets: Linear description and optimization. Math. Program. 82, 1998, 159--173 more… BibTeX

1997

  • Arnim, Annelie von; Schulz, Andreas S.: Facets of the Generalized Permutahedron of a Poset. Discrete Applied Mathematics 72 (1-2), 1997, 179--192 more… BibTeX
  • Hall, Leslie A.; Schulz, Andreas S.; Shmoys, David B.; Wein, Joel: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Math. Oper. Res. 22 (3), 1997, 513--544 more… BibTeX
  • Schulz, Andreas S.; Skutella, Martin: Random-Based Scheduling: New Approximations and LP Lower Bounds. Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM'97, Bolognna, Italy, July 11-12. 1997, Proceedings, 1997Bolognna, Italy more… BibTeX
  • Schulz, Andreas S.; Skutella, Martin: Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings, 1997Graz, Austria more… BibTeX

1996

  • Chakrabarti, Soumen; Phillips, Cynthia A.; Schulz, Andreas S.; Shmoys, David B.; Stein, Clifford; Wein, Joel: Improved Scheduling Algorithms for Minsum Criteria. Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, 1996Paderborn, Germany more… BibTeX
  • Hartmann, Stephan; Schäffter, Markus W.; Schulz, Andreas S.: Switchbox Routing in VLSI Design: Closing the Complexity Gap. Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, 1996Cadenabbia (Como), Italy more… BibTeX
  • Möhring, Rolf H.; Schäffter, Markus W.; Schulz, Andreas S.: Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, 1996Barcelona, Spain more… BibTeX
  • Müller, Rudolf; Schulz, Andreas S.: Transitive Packing. Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, 1996Vancouver, British Columbia, Canada more… BibTeX
  • Schulz, Andreas S.: Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, 1996Vancouver, British Columbia, Canada more… BibTeX

1995

  • Müller, Rudolf; Schulz, Andreas S.: The Interval Order Polytope of a Digraph. Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, 1995Copenhagen, Denmark more… BibTeX
  • Queyranne, Maurice; Schulz, Andreas S.: Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, 1995Copenhagen, Denmark more… BibTeX
  • Schulz, Andreas S.: The Permutahedron of Series-parallel Posets. Discrete Applied Mathematics 57 (1), 1995, 85--90 more… BibTeX
  • Schulz, Andreas S.; Weismantel, Robert; Ziegler, Günter M.: 0/1-Integer Programming: Optimization and Augmentation are Equivalent. Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, 1995Corfu, Greece more… BibTeX