Conferences in DBLP
Gérard Cornuéjols , Bertrand Guenin , François Margot The Packing Property. [Citation Graph (0, 0)][DBLP ] Conf ] Bertrand Guenin A Characterization of Weakly Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Grigor Gasparyan Bipartite Designs. [Citation Graph (0, 0)][DBLP ] Conf ] András Sebö Characterizing Noninteger Polyhedra with 0-1 Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Conforti , Ajai Kapoor A Theorem of Truemper. [Citation Graph (0, 0)][DBLP ] Conf ] Daishin Nakamura , Akihisa Tamura The Generalized Stable Set Problem for Claw-Free Bidirected Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Szigeti On a Min-max Theorem of Cacti. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Peter Eades Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Carr , R. Ravi A New Bound for the 2-Edge Connected Subgraph Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , András Sebö , Zoltán Szigeti An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Cristina G. Fernandes , Bruce A. Reed Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros G. Kolliopoulos , Clifford Stein Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Balaji Raghavachari , Jeyakesavan Veerasamy Approximation Algorithms for the Mixed Postman Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Fabián A. Chudak Improved Approximation Algorithms for Uncapitated Facility Location. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander I. Barvinok , David S. Johnson , Gerhard J. Woeginger , Russell Woodroofe The Maximum Traveling Salesman Problem Under Polyhedral Norms. [Citation Graph (0, 0)][DBLP ] Conf ] Hernán G. Abeledo , Gary Atkinson Polyhedral Combinatorics of Benzenoid Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Christof , Marcus Oswald , Gerhard Reinelt Consecutive Ones and a Betweenness Problem in Computational Biology. [Citation Graph (0, 0)][DBLP ] Conf ] Karen Aardal , Cor A. J. Hurkens , Arjen K. Lenstra Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Martin , Robert Weismantel The Intersection of Knapsack Polyhedra and Extensions. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete , Jörg Schepers New Classes of Lower Bounds for Bin Packing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastián Ceria , Gábor Pataki Solving Integer and Disjunctive Programs by Lift and Project. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard Cornuéjols , Milind Dawande A Class of Hard Small 0-1 Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Fleischer Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. [Citation Graph (0, 0)][DBLP ] Conf ] Éva Tardos , Kevin D. Wayne Simple Generalized Maximum Flow Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit S. Hochbaum The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Jeffrey D. Oldham , Serge A. Plotkin , Clifford Stein An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. [Citation Graph (0, 0)][DBLP ] Conf ] Han Hoogeveen , Petra Schuurman , Gerhard J. Woeginger Non-approximability Results for Scheduling Problems with Minsum Criteria. [Citation Graph (0, 0)][DBLP ] Conf ] Alix Munier , Maurice Queyranne , Andreas S. Schulz Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Michael A. Bender An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP ] Conf ] R. N. Uma , Joel Wein On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Kaibel Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Helmberg , Krzysztof C. Kiwiel , Franz Rendl Incorporating Inequality Constraints in the Spectral Bundle Method. [Citation Graph (0, 0)][DBLP ] Conf ] 