Search the dblp DataBase

Publications of Author

1. Volker Kaibel, Marc E. Pfetsch
   Some Algorithmic Problems in Polytope Theory. [Citation Graph (0, 0)][DBLP]
   Algebra, Geometry, and Software Systems, 2003, pp:23-47 [Conf]
   
2. Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
   Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. [Citation Graph (0, 0)][DBLP]
   IPCO, 1999, pp:45-59 [Conf]
   
3. Tobias Harks, Stefan Heinz, Marc E. Pfetsch
   Competitive Online Multicommodity Routing. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:240-252 [Conf]
   
4. Volker Kaibel, Marc E. Pfetsch
   Computing the face lattice of a polytope from its vertex-facet incidences. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2002, v:23, n:3, pp:281-290 [Journal]
   
5. Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
   On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2003, v:95, n:3, pp:533-554 [Journal]
   
6. Michael Joswig, Marc E. Pfetsch
   Computing Optimal Morse Matchings. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2006, v:20, n:1, pp:11-25 [Journal]
   
7. Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch
   Orbitopal Fixing. [Citation Graph (0, 0)][DBLP]
   IPCO, 2007, pp:74-88 [Conf]
   
8. 
   Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. [Citation Graph (, )][DBLP]
   
   
9. 
   Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System. [Citation Graph (, )][DBLP]
   
   
10. 
    Optimal Fares for Public Transport. [Citation Graph (, )][DBLP]
    
    
11. 
    Routing in Line Planning for Public Transport. [Citation Graph (, )][DBLP]