| 2012 | ||
|---|---|---|
| j6 | Ulrich Faigle, Walter Kern, Britta Peis: A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132(1-2): 393-407 (2012) | |
| c19 | Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella: Flows over Time with Negative Transit Times and Arc Release Dates. CTW 2012: 30-33 | |
| c18 | Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis: Abstract Flows over Time. CTW 2012: 157-161 | |
| c17 | ||
| c16 | Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis: Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. ISAAC 2012: 433-443 | |
| i5 | ||
| i4 | ||
| i3 | Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis: Abstract flows over time: A first step towards solving dynamic packing problems. CoRR abs/1211.2177 (2012) | |
| i2 | Jannik Matuschke, Britta Peis: Lattices and maximum flow algorithms in planar graphs. CoRR abs/1211.2189 (2012) | |
| 2011 | ||
| c15 | S. Thomas McCormick, Britta Peis: A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO 2011: 324-335 | |
| c14 | Britta Peis, Andreas Wiese: Universal Packet Routing with Arbitrary Bandwidths and Transit Times. IPCO 2011: 362-375 | |
| c13 | ||
| 2010 | ||
| j5 | Ulrich Faigle, Britta Peis: Two-phase greedy algorithms for some classes of combinatorial linear programs. ACM Transactions on Algorithms 6(4) (2010) | |
| c12 | ||
| c11 | Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123 | |
| c10 | Britta Peis, Sebastian Stiller, Andreas Wiese: Policies for Periodic Packet Routing. ISAAC (2) 2010: 266-278 | |
| c9 | ||
| c8 | Britta Peis, Andreas Wiese: Throughput Maximization for Periodic Packet Routing on Trees and Grids. WAOA 2010: 213-224 | |
| c7 | Jannik Matuschke, Britta Peis: Lattices and Maximum Flow Algorithms in Planar Graphs. WG 2010: 324-335 | |
| i1 | Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010) | |
| 2009 | ||
| c6 | Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese: Real-Time Message Routing and Scheduling. APPROX-RANDOM 2009: 217-230 | |
| c5 | Britta Peis, Martin Skutella, Andreas Wiese: Packet Routing: Complexity and Algorithms. WAOA 2009: 217-228 | |
| 2008 | ||
| j4 | Martin Lätsch, Britta Peis: On a relation between the domination number and a strongly connected bidirection of an undirected graph. Discrete Applied Mathematics 156(17): 3194-3202 (2008) | |
| j3 | Ulrich Faigle, Britta Peis: Note on pseudolattices, lattices and submodular linear programs. Discrete Optimization 5(2): 489-500 (2008) | |
| c4 | ||
| c3 | Ulrich Faigle, Britta Peis: Two-phase greedy algorithms for some classes of combinatorial linear programs. SODA 2008: 161-166 | |
| 2007 | ||
| j2 | Ulrich Faigle, Bernhard Fuchs, Britta Peis: Note on maximal split-stable subgraphs. Discrete Applied Mathematics 155(15): 2031-2038 (2007) | |
| c2 | Ulrich Faigle, Britta Peis: A two-phase greedy algorithm for modular lattice polyhedra. CTW 2007: 33-37 | |
| 2006 | ||
| j1 | Winfried Hochstättler, Robert Nickel, Britta Peis: Two disjoint negative cycles in a signed graph. Electronic Notes in Discrete Mathematics 25: 107-111 (2006) | |
| c1 | Ephraim Korach, Thành Nguyen, Britta Peis: Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. SODA 2006: 842-850 | |
Colors in the list of coauthors
Last update Mon May 20 18:41:09 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page