direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

M

Megow, N..
Performance analysis of on-line algorithms in machine scheduling.
Diploma thesis, Technische Universität Berlin, 2002.


Megow, N., Möhring, R. H. and Schulz, J..
Turnaround Scheduling in Chemical Manufacturing.
In Proceedings of the 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2007), 2007.


Megow, N., Möhring, R. H. and Schulz, J..
Decision Support and Optimization in Shutdown and Turnaround Scheduling.
INFORMS J. on Computing, Vol. 23, pp. 189–204, 2011.

Link zur Publikation Link zur Originalpublikation


Megow, N. and Mestre, J..
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints.
In Proceedings of the 4th Innovations in Theoretical Computer Science (ITCS 2013), pp. 495-504, 2013.

Link zur Publikation


Megow, N., Mehlhorn, K. and Schweitzer, P..
Online graph exploration: New results on old and new algorithms.
Theoretical Computer Science, Vol. 463, pp. 62-72, 2012. Special Issue on Theory and Applications of Graph Searching Problems.

Link zur Publikation Link zur Originalpublikation


Menne, U., Wessäly, R., Martens, M. and Bley, A..
Integrated optimization of aggregation and core for varying NGN architectures.
In M. Pióro and K. Szczypiorski and J. Rak and O. Gonzalez-Soto (ed.)Proceedings of the 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2010), Warsaw, Poland, IEEE Xplore, pp. 228–233, IEEE, 2010. Extended version submitted to Telecommunication Systems.

Link zur Publikation


Mittal, S., Schulz, A. and Stiller, S..
Robust appointment scheduling.
In Proceedings of APPROX 2014, 2014. to appear.


Mittal, S. and Stiller, S..
Robust appointment scheduling.
In Proceedings of the MSOM Annual Conference, 2011.


Montanari, S., Mihalák, M. and Disser, Y..
Max Shortest Path for Imprecise Points.
In Proceedings of the 31st European Workshop on Computational Geometry (EuroCG), 2015. to appear.


Morell, S. and Skutella, M..
Single source unsplittable flows with arc-wise lower and upper bounds.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Springer, 2020.


Morell, S., Seidel, I. and Weltge, S..
Minimum-cost integer circulations in given homology classes.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA21), 2021.

Link zur Publikation


Möhring, R. H., Skutella, M. and Stork, F..
Scheduling with AND/OR Precedence Constraints.
SIAM Journal on Computing, Vol. 33, pp. 393–415, 2004.

Link zur Publikation


Möhring, R. H., Skutella, M. and Stork, F..
Forcing Relations for AND/OR Precedence Constraints.
In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 235–236, San Francisco, CA, 2000.


Müller, R..
Bounds for linear VLSI layout problems.
Doctoral thesis, TU Berlin, 1993.


Müller-Hannemann.
Quadrilateral Mesh Generation in Computer-Aided Design.
Doctoral thesis, TU Berlin, 1997.


N

Naatz, M..
Acyclic Orientations of Mixed Graphs.
Doctoral thesis, TU Berlin, 2001.


Nasrabadi, E..
Dynamic Flows in Time-varying Networks.
Doctoral thesis, Amirkabir University of Technology / TU Berlin, 2009.


Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L. and Wu, J..
A Fully Polynomial Time Approximation Scheme for Packing While Traveling.
In Disser, Yann and Verykios, Vassilios S. (ed.)Algorithmic Aspects of Cloud Computing – Fourth International Workshop, ALGOCLOUD 2018, pp. 59–72, Springer, 2018.


Neumann, G., Tammer, C., Weinkauf, R. and Welz, W..
A GIS-based Decision Support for Multicriteria Location-Routing Problems.
In Küfer, Karl-Heinz and Rommelfanger, Heinrich and Tammer, Christiane and Winkler, Kristin (ed.)Multicriteria Decision Making and Fuzzy Systems. Theory, Methods and Applications, pp. 157-173, Aachen: Shaker Verlag, 2006.


Neumann, F., Reichel, J. and Skutella, M..
Computing Minimum Cuts by Randomized Search Heuristics.
Algorithmica, Vol. 59, pp. 323–342, 2011.

Link zur Publikation


Neumann, F., Reichel, J. and Skutella, M..
Computing Minimum Cuts by Randomized Search Heuristics.
In Proceedings of the 10th Genetic and Evolutionary Computation Conference, pp. 779–787, 2008.


Neumann, F. and Theile, M..
How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem.
In Proceedings of the Parallel Problem Solving from Nature (PPSN XI), pp. 667-676, 2010.

Link zur Publikation


Niemeier, M. and Wiese, A..
Scheduling with an Orthogonal Resource Constraint.
In 10th Workshop on Approximation and Online Algorithms (WAOA2012), 2012.


Niemeier, M., Wiese, A. and Baruah, S..
Partitioned Real-Time Scheduling on Heterogeneous Shared-Memory Multiprocessors.
In Proceedings of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011), 2011. to appear.

Link zur Publikation


O

Oellrich, M..
Minimum Cost Disjoint Paths under Arc Dependences - Algorithms for Practice.
Doctoral thesis, TU Berlin, 2008.


P

Parra, A..
Structural and Algorithmic Aspects of Chordal Graph Embeddings.
Doctoral thesis, TU Berlin, 1996.


Peis, B., Skutella, M. and Wiese, A..
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
In Jansen, Klaus and Solis-Oba, Roberto (ed.)Approximation and Online Algorithms, 8th International Workshop, WAOA 2009, Lecture Notes in Computer Science, Springer, Vol. 6534, pp. 213-224, 2010.


Peis, B., Skutella, M. and Wiese, A..
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus (ed.)Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, Lecture Notes in Computer Science, Springer, Vol. 5893, pp. 217–228, 2010.



Peis, B., Skutella, M. and Wiese, A..
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus (ed.)Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 2009. Revised Papers, pp. 217–228, Springer, 2010.

Link zur Publikation


Peis, B., Stiller, S. and Wiese, A..
Policies for Periodic Packet Routing.
In Cheong, Otfried and Chwa Kyung-Yong and Park, Kunsoo (ed.)Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, Lecture Notes in Computer Science, Springer, Vol. 6507, pp. 266–278, 2010.


Peis, B. and Wiese, A..
Universal packet routing with arbitrary bandwidths and transit times.
In Integer Programming and Combinatorial Optimization (IPCO 2011), pp. 362-375, Springer, 2011.


Peis, B. and Wiese, A..
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
In Approximation and Online Algorithms (WAOA 2010), pp. 213–224, Springer, 2011.


Pham, H. M. and Sering, L..
Dynamic Equilibria in Time-Varying Networks.
In International Symposium on Algorithmic Game Theory, pp. 130–145, 2020.

Link zur Originalpublikation


R

Reichel, J. and Skutella, M..
Evolutionary Algorithms and Matroid Optimization Problems.
Algorithmica, Vol. 57, pp. 187–206, 2010.

Link zur Publikation


Reichel, J. and Skutella, M..
On the size of weights in randomized search heuristics.
In Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms, pp. 21–28, New York, ACM, 2009.

Link zur Publikation


Reichel, J. and Skutella, M..
Evolutionary Algorithms and Matroid Optimization Problems.
In Proceedings of the 9th Genetic and Evolutionary Computation Conference, pp. 947–954, 2007.


Rezapour, M..
Network Design with Facility Location.
Doctoral thesis, TU Berlin, 2015.

Link zur Publikation


Ripphausen-Lipa, H..
Efficient Algorithms for Disjoint Steiner Trees Packing Problems in Planar Graphs.
Doctoral thesis, TU Berlin, 1994.


Rischke, R..
Two-Stage Robust Combinatorial Optimization with Priced Scenarios.
In Operations Research Proceedings 2013 - Selected Papers of the International Conference on Operations Research (OR'13), pp. 377–382, 2014.

Link zur Originalpublikation


Ruhl, M., Knuschke, T., Schewior, K., Glavinic, L., Neumann-Haefelin, C., Chang, D.-I., Klein, M., Heinemann, F. M., Tenckhoff, H., Wiese, M., Horn, P. A., Viazov, S., Spengler, U., Roggendorf, M., Scherbaum, N., Nattermann, J., Hoffmann, D. and Timm, J..
CD8+ T-Cell Response Promotes Evolution of Hepatitis C Virus Nonstructural Proteins.
Gastroenterology, Vol. 140, pp. 2064–2073, 2011.


S

Sagnol, G., Schmidt genannt Waldschmidt, D. and Tesch, A..
The Price of Fixed Assignments in Stochastic Extensible Bin Packing.
In Approximation and Online Algorithms (WAOA '18), Lecture Notes in Computer Science, Vol. 11312, pp. 327–347, Springer, 2018.


Salazar, F. and Skutella, M..
Single-source k-splittable min-cost flows.
Operations Research Letters, Vol. 37, pp. 71–74, 2009.

Link zur Publikation


Sanders, P., Sivadasan, N. and Skutella, M..
Online Scheduling with Bounded Migration.
In Diaz, Josep and Karhumäki, Juhani and Lepistö, Arto and Sannella, Donald (ed.)Automata, Languages and Programming, pp. 1111–1122, Springer, 2004.


Sanders, P., Sivadasan, N. and Skutella, M..
Online Scheduling with Bounded Migration.
Mathematics of Operations Research, Vol. 34, pp. 481–498, 2009.

Link zur Publikation


Schewior, K..
Handling Critical Tasks Online.
Doctoral thesis, TU Berlin, 2016.

Link zur Publikation


Schilling, H..
Route Assignment Problems in Large Networks.
Doctoral thesis, TU Berlin, 2006.

Link zur Publikation


Schlöter, M. and Skutella, M..
Fast and Memory-Efficient Algorithms for Evacuation Problems.
In Klein, Philip N. (ed.)Proceedings of the 28th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 821-840, SIAM, 2017.


Schmidt, M. and Skutella, M..
Earliest Arrival Flows in Networks with Multiple Sinks.
Discrete Applied Mathematics, Vol. 164, pp. 320-327, 2014.


Schmidt, M. and Skutella, M..
Earliest arrival flows in networks with multiple sinks.
Discrete Applied Mathematics, 2011. http://www.sciencedirect.com/science/article/pii/S0166218X11003593.

Link zur Publikation Link zur Originalpublikation


Zusatzinformationen / Extras