direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

H

Harks, T., Kleinert, I., Klimm, M. and Möhring, R. H..
Computing network tolls with support constraints.
Networks, Vol. 65, pp. 262-285, 2015.


Hartmann, S..
Layout Problems in VLSI Circuit Design.
Doctoral thesis, TU Berlin, 1999.


Haunert, J.-H. and Sering, L..
Drawing Road Networks with Focus Regions.
IEEE Transactions on Visualization and Computer Graphics, Vol. 17, pp. 2555-2562, 2011.

Link zur Publikation


Heinz, S., Krumke, S. O., Megow, N., Rambau, J., Tuchscherer, A. and Vredeveld, T..
The Online Target Date Assignment Problem.
In Approximation and Online Algorithms (WAOA'05), Lecture Notes in Computer Science, Vol. 3879, pp. 192-205, Springer, 2006.

Link zur Publikation Link zur Originalpublikation


Heinz, S. and Schulz, J..
Explanations for the Cumulative Constraint: An Experimental Study.
In Panos M.\ Pardalos and Steffen Rebennack (ed.)Experimental Algorithms (SEA 2011), Lecture Notes in Computer Science, Vol. 6630, pp. 400–409, Springer, 2011.


Hochstättler, W., Nickel, R. and Peis, B..
Two disjoint negative cycles in a signed graph.
In Faigle, Ulrich and Hurink, Johann and Schrader, Rainer and Schultz, Rüdiger (ed.)Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Lambrecht, Germany, pp. 107-111, 2006.


Hoogeveen, H., Skutella, M. and Woeginger, G. J..
Preemptive scheduling with rejection.
In Mike Paterson (ed.)Algorithms – ESA '00, pp. 268–277, Springer, 2000.


Hoogeveen, H., Skutella, M. and Woeginger, G. J..
Preemptive scheduling with rejection.
Mathematical Programming, Vol. 94, pp. 361–374, 2003.

Link zur Publikation



Höhn, W., Jacobs, T. and Megow, N..
On Eulerian extensions and their application to no-wait flowshop scheduling.
Journal of Scheduling, Vol. 15, pp. 295-309, 2012.

Link zur Publikation Link zur Originalpublikation


Höhn, W., König, F. G., Lübbecke, M. E. and Möhring, R. H..
Integrated Sequencing and Scheduling in Coil Coating.
Management Science, Vol. 57, pp. 647–666, 2011. Finalist for the EURO Excellence in Practice Award 2009.

Link zur Publikation Link zur Originalpublikation


Höhn, W., Mestre, J. and Wiese, A..
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions.
In Proc. of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), LNCS, Vol. 8572, pp. 625-636, Springer, 2014.

Link zur Publikation Link zur Originalpublikation


Höhn, W. and Jacobs, T..
On the performance of Smith's rule in single-machine scheduling with nonlinear cost.
ACM Transactions on Algorithms, Vol. 11, pp. Article 25, 2015.


Höhn, W. and Jacobs, T..
An experimental and analytical study of order constraints for single machine scheduling with quadratic cost.
In Proc. of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 103-117, SIAM, 2012.

Link zur Publikation


Höhn, W. and Jacobs, T..
On the performance of Smith's rule in single-machine scheduling with nonlinear cost.
In Proc. of the 10th Latin American Theoretical Informatics Symposium (LATIN), LNCS, Vol. 7256, pp. 482-493, Springer, 2012.

Link zur Publikation Link zur Originalpublikation


I

Israel, J. and Sering, L..
The Impact of Spillback on the Price of Anarchy for Flows over Time.
In International Symposium on Algorithmic Game Theory, pp. 114–129, 2020.

Link zur Originalpublikation


J

Jansen, T. and Theile, M..
Stability in the Self-Organized Evolution of Networks.
Algorithmica, Vol. 57, pp. 147-169, 2010.


Jansen, T. and Theile, M..
Stability in the self-organized evolution of networks.
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 931-938, 2007.


Jäger, S. and Schöbel, A..
The blockwise coordinate descent method for integer programs.
Mathematical Methods of Operations Research, Vol. 91, pp. 357–381, 2019.

Link zur Publikation Link zur Originalpublikation



Jäger, S. and Skutella, M..
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling.
In Niedermeier, Rolf and Vallée, Brigitte (ed.)35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 96, pp. 43:1–43:14, Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.

Link zur Originalpublikation


K

Kanj, I., Wiese, A. and Zhang, F..
Local Algorithms for Edge Colorings in UDGs.
In Paul, Christophe and Habib, Michel (ed.)Graph-Theoretic Concepts in Computer Science (WG 2010), pp. 202-213, Springer, 2010.

Link zur Publikation



Kappmeier, J.-P. W., Matuschke, J. and Peis, B..
Abstract flows over time: A first step towards solving dynamic packing problems.
Theoretical Computer Science, Vol. 544, pp. 74-85, 2014.

Link zur Publikation Link zur Originalpublikation


Kappmeier, J.-P..
Berechnung maximaler Flüsse unter Vermeidung von Residualnetzwerken.
Diploma thesis, TU Dortmund, 2009. In German.

Link zur Publikation


Kappmeier, J.-P. W., Matuschke, J. and Peis, B..
Abstract flows over time: A first step towards solving dynamic packing problems.
In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee (ed.)Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, Lecture Notes in Computer Science, pp. 433-443, Springer, 2012.

Link zur Publikation Link zur Originalpublikation


Karrenbauer, A. and Rothvoß, T..
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling.
In Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009), Lecture Notes in Computer Science, Vol. 5757, pp. 432–443, Springer, 2009.

Link zur Publikation


Karrenbauer, A. and Rothvoß, T..
A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks.
In Proceedings of the 8th International Workshop on Approximation and Online Algorithms (WAOA 2010), Lecture Notes in Computer Science, Vol. 6534, pp. 166-177, Springer, 2011.


Katriel, I., Kutz, M. and Skutella, M..
Reachability Substitutes for Planar Digraphs.
Preprint MPI-I-2005-1-002, Max-Planck-Institut für Informatik, 2005.

Link zur Publikation



Klimm, M. and Weibull, J. W..
Finding all minimal CURB sets.
. SSE/EFI Working Paper Series in Economics and Finance No 722, 20 pages, July 1, 2009, \texttturlhttp://swopec.hhs.se/hastef/abs/hastef0722.htm.


Klimm, M., Pfetsch, M. E., Raber, R. and Skutella, M..
Packing under Convex Quadratic Constraints.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Springer, 2020.


Klimm, M. and Schütz, A..
Congestion games with higher demand dimensions.
In Proceedings of the 10th Conference on Web and Internet Economics (WINE), pp. 453-459, 2014.


Klimm, M. and Schmand, D..
Sharing non-anonymous costs of multiple resources optimally.
In Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC), pp. 274-287, 2015.


Klimm, M..
Competition for Resources: The equilibrium Existence Problem in Congestion Games.
In Selected Papers of the International Conference on Operations Research (OR2013), 2014.


Koch, R..
Routing Games over Time.
Doctoral thesis, TU Berlin, 2012.

Link zur Publikation


Koch, R. and Nasrabadi, E..
Strong Duality for the Maximum Borel Flow Problem.
In Pahl, J. and Reiners, T. and Voß, S. (ed.)Network Optimization – 5th International Conference, INOC 2011, Lecture Notes in Computer Science, Vol. 6701, pp. 256–261, Springer, 2011.


Koch, R., Nasrabadi, E. and Skutella, M..
Continuous and discrete flows over time.
Mathematical Methods of Operations Research, 2011. To appear.

Link zur Publikation


Koch, R., Peis, B., Skutella, M. and Wiese, A..
Real-Time Message Routing and Scheduling.
In Jansen, Klaus and Naor, Joseph and Rolim, Jose (ed.)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX-RANDOM 2009, Berkeley, USA, Lecture Notes in Computer Science, Springer, Vol. 5687, pp. 217–230, 2009.


Koch, R. and Skutella, M..
Nash Equilibria and the Price of Anarchy for Flows Over Time.
In Mavronicolas, Marios and Papadopoulou, Vicky G. (ed.)Proceedings of the 2nd International Symposium on Algorithmic Game Theory, pp. 323–334, Springer, 2009.


Koch, R. and Skutella, M..
Nash Equilibria and the Price of Anarchy for Flows Over Time.
Theory of Computing Systems, Vol. 49, pp. 71–97, 2011.

Link zur Publikation


Koch, R., Skutella, M. and Spenke, I..
Approximation and Complexity of k-Splittable Flows.
In Erlebach, Thomas and Persiano, Giuseppe (ed.)Proceedings of the Third International Workshop on Approximation and Online Algorithms, pp. 244–257, Springer, 2006.


Koch, R., Skutella, M. and Spenke, I..
Maximum k-Splittable s,t-Flows.
Theory of Computing Systems, Vol. 43, pp. 56–66, 2008.

Link zur Publikation


Korach, E., Peis, B. and Thánh, N..
Subgraph Characterization of Red/Blue-Split Graphs and König-Egerváry Graphs.
In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, ACM Press, pp. 842-850, 2006.


Kranakis, E. and Wiese, A..
Impact of Locality on Location Aware Unit Disk Graphs.
Proceedings of the 2nd International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks (LOCALGOS 2008), Vol. 1, pp. 2–29, 2008.

Link zur Publikation


Kranakis, E. and Wiese, A..
Local PTAS for Independent Set and Vertex Cover in Location Aware UDGs.
In Distributed Computing in Sensor Systems (DCOSS 2008), pp. 415–431, Springer, 2008.


Kranakis, E. and Wiese, A..
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.
In Graph-Theoretic Concepts in Computer Science (WG 2008), pp. 372-383, Springer, 2008. 10.1007/978-3-540-92248-3_33.

Link zur Publikation


Kranakis, E. and Wiese, A..
Local PTAS for Dominating and Connected Dominating Set in Location Aware UDGs.
In Approximation and Online Algorithms (WAOA 2008), pp. 227-240, Springer, 2008.


Kranakis, E. and Wiese, A..
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs.
In Ad-hoc, Mobile and Wireless Networks (ADHOC-NOW 2008), pp. 1–14, Springer, 2008.

Link zur Publikation


Krumke, S. O., Megow, N. and Vredeveld, T..
How to Whack Moles.
In Approximation and Online Algorithms (WAOA'03), Lecture Notes in Computer Science, Vol. 2909, pp. 192–205, Springer, 2004.


Zusatzinformationen / Extras