Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 4.

Journal Article

Dressler, Daniel, Groß, Martin, Kappmeier, Jan-Philipp, Kelter, Timon, Kulbatzki, Joscha, Plümpe, Daniel ORCID: 0000-0001-7381-912X, Schlechter, Gordon, Schmidt, Melanie ORCID: 0000-0003-4856-3905, Skutella, Martin and Temme, Sylvie (2010). On the use of network flow techniques for assigning evacuees to exits. Procedia Engineering, 3. pp. 205-215. Amsterdam [u.a.]: Elsevier. ISSN 1877-7058

Book Section, Proceedings Item or annotation in a legal commentary

Bercea, Ioana Oriana, Groß, Martin, Khuller, Samir, Kumar, Aounon, Rösner, Clemens, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie ORCID: 0000-0003-4856-3905 (2019). On the Cost of Essentially Fair Clusterings. In: Approximation, randomization, and combinatorial optimization: algorithms and techniques : APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, 18:1-18:22. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. ISBN 9783959771252

Groß, Martin, Gupta, Anupam, Kumar, Amit, Matuschke, Jannik, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X, Schmidt, Melanie ORCID: 0000-0003-4856-3905 and Verschae, José (2018). A Local-Search Algorithm for Steiner Forest. In: 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 31:1-31:17. Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. ISBN 978-3-95977-060-6

Groß, Martin, Kappmeier, Jan-Philipp W., Schmidt, Daniel R. ORCID: 0000-0001-7381-912X and Schmidt, Melanie ORCID: 0000-0003-4856-3905 (2012). Approximating Earliest Arrival Flows in Arbitrary Networks. In: Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 551-562. Berlin: Springer. ISBN 978-3-642-33090-2

This list was generated on Fri Oct 23 01:31:21 2020 CEST.