TU Berlin

Britta PeisPublications

Page Content

to Navigation

Publications

Wiese, Andreas and Peis, Britta.
Universal Packet Routing with Arbitrary Bandwidths and Transit Times.
In Günlück, Oktay and Woeginger, Gerhard (ed.)Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, USA, Lecture Notes in Computer Science, Springer, Vol. 6655, pp. 362–375, 2011.


Skutella, Martin and Peis, Britta and Wiese, Andreas.
Packet Routing on the Grid.
In Lopez-Ortiz, Alejandro (ed.)Theoretical Informatics, 9th Latin American Symposium, LATIn 2010, Oaxaca, Mexico, Lecture Notes in Computer Science, Springer, Vol. 6034, pp. 120-130, 2010.


Peis, Britta and Skutella, Martin and Wiese, Andreas.
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, Britta and Skutella, Martin and Wiese, Andreas.
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, Britta and Skutella, Martin and Wiese, Andreas.
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 to publication


Peis, Britta and Stiller, Sebastian and Wiese, Andreas.
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, Britta and Wiese, Andreas.
Universal packet routing with arbitrary bandwidths and transit times.
In Integer Programming and Combinatorial Optimization (IPCO 2011), pp. 362-375, Springer, 2011.


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


McCormick, S. Tom and Peis, Britta.
A Primal-Dual Algorithm for Weighted Abstract Cut Packing.
In Günlück, Oktay and Woeginger, Gerhard (ed.)Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, USA, Lecture Notes in Computer Science, Springer, Vol. 6655, pp. 324-335, 2011.


Matuschke, Jannik and Peis, Britta.
Lattices and Maximum Flow Algorithms in Planar Graphs.
In Thilikos, Dimitrios (ed.)Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, Lecture Notes in Computer Science, Springer, Vol. 6410, pp. 324-335, 2010.

Link to original publication


Matuschke, Jannik and McCormick, S. Thomas and Oriolo, Gianpaolo and Peis, Britta and Skutella, Martin.
Protection of flows under targeted attacks.
Operations Research Letters, Vol. 45, pp. 53-59, 2017.


Lätsch, Martin and Peis, Britta.
On a Relation Between the Domination Number and a Strongly Connected Bidirection of an Undirected Graph.
Discrete Applied Mathematics, Vol. 156, pp. 3194-3202, 2008.


Korach, Ephraim and Peis, Britta and Thánh, Nguyen.
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.


Koch, Ronald and Peis, Britta and Skutella, Martin and Wiese, Andreas.
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.


Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe