Conferences in DBLP
Imre Bárány , Roger Howe , Herbert E. Scarf The complex of maximal lattice free simplices. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan Optimal solution and value of parametric integer programs. [Citation Graph (0, 0)][DBLP ] Conf ] Egon Balas , Matteo Fischetti On the monotonization of polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , R. Ravi When cycles collapse: A general approximation technique for constrained two-connectivity problems. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , Michel X. Goemans , David P. Williamson An efficient approximation algorithm for the survivable network design problem. [Citation Graph (0, 0)][DBLP ] Conf ] Tibor Jordán Optimal and almost optimal algorithms for connectivity augmentation problems. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Zelikovsky An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Robert F. Cohen , Sairam Sairam , Roberto Tamassia , Jeffrey Scott Vitter Dynamic algorithms for optimization problems in bounded tree-width graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Galluccio , Martin Loebl Cycles of prescribed modularity in planar digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Hitoshi Suzuki , Takao Nishizeki Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Kellerer , Franz Rendl , Gerhard J. Woeginger Computing the optimum stock size. [Citation Graph (0, 0)][DBLP ] Conf ] Florin Avram , Dimitris Bertsimas On a characterization of the minimum assignment and matching in the independent random model. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Jerrum An analysis of a Monte Carlo algorithm for estimating the permanent. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Helmberg , Bojan Mohar , Svatopluk Poljak , Franz Rendl A spectral approach to bandwidth and separator problems in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] J. A. Hoogeveen , Steef L. van de Velde Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. [Citation Graph (0, 0)][DBLP ] Conf ] E. Andrew Boyd Solving integer programs with Fenchel cutting planes and preprocessing. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Lomonosov , András Sebö On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Frieda Granot , Michal Penn On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg An efficient implementation of a scaling minimum-cost flow algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] William R. Pulleyblank , F. Bruce Shepherd Formulations for the stable set polytope of a claw-free graph. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Vijay V. Vazirani A polyhedron with all s-t cuts as vertices, and adjacency of cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Maurice Clochard , Denis Naddef Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , David P. Williamson A new \frac34-approximation algorithm for MAX SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , R. Ravi A nearly best-possible approximation algorithm for node-weighted Steiner trees. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Uzi Vishkin , Neal E. Young A primal-dual parallel approximation technique applied to weighted set and vertex cover. [Citation Graph (0, 0)][DBLP ] Conf ] S. Thomas McCormick , Thomas R. Ervolina Canceling most helpful total submodular cuts for submodular flow. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Bertsimas , José Niño-Mora Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Queyranne , Frits C. R. Spieksma , Fabio Tardella A general class of greedily solvable linear programs. [Citation Graph (0, 0)][DBLP ] Conf ] Masataka Nakamura Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Szigeti On Lovász's cathedral theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Shin-Ichi Nakano , Takao Nishizeki Nearly uniform scheduling of file transfers. [Citation Graph (0, 0)][DBLP ] Conf ] András Sebö Circuit packings on surfaces with at most three cross-caps. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grötschel , Alexander Martin , Robert Weismantel Routing in grid graphs by cutting planes. [Citation Graph (0, 0)][DBLP ] Conf ] Rudolf Müller On the transitive acyclic subdigraph polytope. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Jünger , Petra Mutzel Solving the maximum weight planar subgraph. [Citation Graph (0, 0)][DBLP ] Conf ] 