direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationen

2006

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.


Hochstättler, Winfried and Nickel, Robert and Peis, Britta.
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.



2008

Faigle, Ulrich and Peis, Britta.
A Hierarchical Model for Cooperative Games.
In Monien, Burkhard and Schroeder, Ulf-Peter (ed.)Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, Lecture Notes in Computer Science, Springer, Vol. 4997, pp. 230-241, 2008.


Faigle, Ulrich and Peis, Britta.
Two-phase Greedy Algorithms for Some Classes of Combinatorial Linear Programs.
In Teng, Shang-Hua (ed.)Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, SIAM, pp. 161-166, 2008. A full version appeared in TALG 2010.


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.


Faigle, Ulrich and Peis, Britta.
Note on Pseudolattices, Lattices and Submodular Linear Programs.
Discrete Optimization, Vol. 5, pp. 489-500, 2008.


Faigle, Ulrich and Fuchs, Bernhard and Peis, Britta.
Note on maximal split-stable subgraphs.
Discrete Applied Mathematics, Vol. 156, pp. 3194-3202, 2008.


2009

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.


2010

Bansal, Nikhil and Khandekar, Rohit and Könemann, Jochen and Nagarajan, Viswanath and Peis, Britta.
On Generalizations of Network Design Problems with Degree Bounds.
In Eisenbrand, Friedrich and Shepherd, F. Bruce (ed.)Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, Lecture Notes in Computer Science, Springer, Vol. 6080, pp. 110-123, 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.


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 zur Originalpublikation


Faigle, Ulrich and Peis, Britta.
Two-phase Greedy Algorithms for Some Classes of Combinatorial Linear Programs.
ACM Transactions on Algorithms, Vol. 6(4), 2010. An extended abstract appeared in SODA 2008-proceedings.


Faigle, Ulrich and Kern, Walter and Peis, Britta.
A Ranking Model for Cooperative Games, Convexity and the Greedy Algorithm.
Math. Programming, (doi:10.1007/s10107-010-0406-2), Vol. A, 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.


Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.