The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "IPCO"( http://dblp.L3S.de/Venues/IPCO )

URL (DBLP): http://dblp.uni-trier.de/db/conf/ipco

Publication years (Num. hits)
1990 (38) 1992 (34) 1993 (36) 1995 (37) 1996 (37) 1998 (33) 1999 (34) 2001 (33) 2002 (34) 2004 (33) 2005 (35) 2007 (37) 2008 (33) 2010 (35) 2011 (34) 2013 (34) 2014 (35) 2016 (34) 2017 (37) 2019 (34) 2020 (34) 2021 (34) 2022 (34) 2023 (34)
Publication types (Num. hits)
inproceedings(809) proceedings(24)
Venues (Conferences, Journals, ...)
IPCO(833)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 84 occurrences of 51 keywords

Results
Found 833 publication records. Showing 833 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Tobias Harks, Veerle Timmermans Equilibrium Computation in Atomic Splittable Singleton Congestion Games. Search on Bibsonomy IPCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. Search on Bibsonomy IPCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michel X. Goemans, Swati Gupta 0001, Patrick Jaillet Discrete Newton's Algorithm for Parametric Submodular Function Minimization. Search on Bibsonomy IPCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch 0001, Bartosz Rybicki A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. Search on Bibsonomy IPCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Prabhanjan Kambadur, Viswanath Nagarajan, Fatemeh Navidi Adaptive Submodular Ranking. Search on Bibsonomy IPCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sylvia C. Boyd, András Sebö The Saleman's Improved Tours for Fundamental Classes. Search on Bibsonomy IPCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang 0005 On Scheduling Coflows - (Extended Abstract). Search on Bibsonomy IPCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amitabh Basu, Timm Oertel Centerpoints: A Link Between Optimization and Convex Geometry. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Amitabh Basu, Robert Hildebrand, Marco Molinaro 0001 Minimal Cut-Generating Functions are Nearly Extreme. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alfredo Torrico, Shabbir Ahmed 0001, Alejandro Toriello A Polyhedral Approach to Online Bipartite Matching. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Cong Han Lim, Jeff T. Linderoth, James R. Luedtke Valid Inequalities for Separable Concave Constraints with Indicator Variables. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jon Lee 0001, Viswanath Nagarajan, Xiangkun Shen Max-Cut Under Graph Constraints. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1James B. Orlin, Andreas S. Schulz, Rajan Udwani Robust Monotone Submodular Function Maximization. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, László A. Végh, Giacomo Zambelli Rescaled Coordinate Descent Methods for Linear Programming. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alberto Del Pia, Jeffrey Poskin On the Mixed Binary Representability of Ellipsoidal Regions. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat Extreme Functions with an Arbitrary Number of Slopes. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Weijun Xie 0001, Shabbir Ahmed 0001 On the Quantile Cut Closure of Chance-Constrained Problems. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Corinna Gottschalk, Jens Vygen Better s-t-Tours by Gao Trees. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alberto Del Pia On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma Extended Formulations in Mixed-Integer Convex Programming. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl Intersection Cuts for Bilevel Optimization. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mourad Baïou, Francisco Barahona Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità Stabilizing Network Bargaining Games by Blocking Players. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anke van Zuylen Improved Approximations for Cubic Bipartite and Cubic TSP. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Samuel Fiorini, Gwenaël Joret, Oliver Schaudt Improved Approximation Algorithms for Hitting 3-Vertex Paths. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gérard Cornuéjols, Yanjun Li Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese Submodular Unsplittable Flow on Trees. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Viswanath Nagarajan Approximation-Friendly Discrepancy Rounding. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1André Linhares, Chaitanya Swamy Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ola Svensson, Jakub Tarnawski, László A. Végh Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gérard Cornuéjols, Dabeen Lee On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ágnes Cseh, Telikepalli Kavitha Popular Edges and Dominant Matchings. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mohit Singh, Rico Zenklusen k-Trails: Recognition, Complexity, and Approximations. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gábor Braun, Sebastian Pokutta, Aurko Roy Strong Reductions for Extended Formulations. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Quentin Louveaux, Martin Skutella (eds.) Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tasuku Soma, Yuichi Yoshida Maximizing Monotone Submodular Functions over the Integer Lattice. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Thai Dinh, Ricardo Fukasawa, James R. Luedtke Exact Algorithms for the Chance-Constrained Vehicle Routing Problem. Search on Bibsonomy IPCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fatma Kilinç-Karzan, Sercan Yildiz Two-Term Disjunctions on the Second-Order Cone. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Iskander Aliev, Jesús A. De Loera, Quentin Louveaux Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Anand Bhalgat, Sanjeev Khanna A Utility Equivalence Theorem for Concave Functions. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Manish Bansal, Kiavash Kianfar n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Chien-Chung Huang, Telikepalli Kavitha An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Volker Kaibel, Stefan Weltge Lower Bounds on the Sizes of Integer Programs without Additional Variables. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza Reverse Split Rank. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa Improved Branch-Cut-and-Price for Capacitated Vehicle Routing. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Henning Bruhn, Oliver Schaudt Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Umang Bhaskar, Katrina Ligett, Leonard J. Schulman Network Improvement for Equilibrium Routing. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson On the Configuration LP for Maximum Budgeted Allocation. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Uriel Feige, R. Ravi 0001, Mohit Singh Short Tours through Large Linear Forests. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Alina Ene The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pierre Bonami, François Margot Cut Generation through Binarization. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku Coupled and k-Sided Placements: Generalizing Generalized Assignment. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Alejandro Angulo Cardenas, Daniel Espinoza, Rodrigo Palma Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds Constraints. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson Centrality of Trees for Capacitated k-Center. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jon Lee 0001, Jens Vygen (eds.) Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Volker Kaibel, Matthias Walter Simple Extensions of Polytopes. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh The Triangle Splitting Method for Biobjective Mixed Integer Programming. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Mourad Baïou, Francisco Barahona Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sylvia C. Boyd, Yao Fu, Yu Sun A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ilan Adler, Christos H. Papadimitriou, Aviad Rubinstein On Simplex Pivoting Rules and Complexity Theory. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Santanu S. Dey, Marco Molinaro 0001, Qianyi Wang How Good Are Sparse Cutting-Planes? Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani Linear Programming Hierarchies Suffice for Directed Steiner Tree. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Gennadiy Averkov, Amitabh Basu On the Unique-Lifting Property. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Lap Chi Lau, Hong Zhou 0001 A Unified Algorithm for Degree Bounded Survivable Network Design. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Viswanath Nagarajan On the Adaptivity Gap of Stochastic Orienteering. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità Finding Small Stabilizers for Unstable Graphs. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Christoph Buchheim, Claudia D'Ambrosio Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ahmad Abdi, Bertrand Guenin The Cycling Property for the Clutter of Odd st-Walks. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Amit Chakrabarti, Sagar Kale Submodular Maximization Meets Streaming: Matchings, Matroids, and More. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Andreas Wiese Scheduling and Fixed-Parameter Tractability. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1David L. Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan Content Placement via the Exponential Potential Function Method. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz 0002, Hadas Shachnai, Tami Tamir All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Thomas Rothvoß A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Stephan Held, Daniel Rotter Shallow-Light Steiner Arborescences with Vertex Delays. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Aris Anagnostopoulos, Fabrizio Grandoni 0001, Stefano Leonardi 0001, Andreas Wiese Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anupam Gupta 0001, Viswanath Nagarajan A Stochastic Probing Problem with Applications. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramírez On Some Generalizations of the Split Closure. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Danny Z. Chen, Jian Li 0015, Hongyu Liang, Haitao Wang 0001 Matroid and Knapsack Center Problems. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hongbo Dong 0001, Jeff T. Linderoth On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Amitabh Basu, Robert Hildebrand, Matthias Köppe Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Zachary Friggstad, Anupam Gupta 0001, Mohit Singh An Improved Integrality Gap for Asymmetric TSP Paths. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Maxim Sviridenko, Andreas Wiese Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1András Sebö Eight-Fifth Approximation for the Path TSP. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Tasuku Soma Fast Deterministic Algorithms for Matrix Completion Problems. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Anupam Gupta 0001, Viswanath Nagarajan, Vijay V. Vazirani Thrifty Algorithms for Multistage Robust Optimization. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe Reverse Chvátal-Gomory Rank. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Attila Bernáth, Gyula Pap Blocking Optimal Arborescences. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Dinitz, Anupam Gupta 0001 Packing Interdiction and Partial Covering Problems. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michel X. Goemans, José Correa 0001 (eds.) Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Benjamin Moseley, Kirk Pruhs, Cliff Stein 0001 The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Thomas Rothvoß, Laura Sanità 0/1 Polytopes with Quadratic Chvátal Rank. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Neil Olver, Rico Zenklusen Chain-Constrained Spanning Trees. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick Cut-Generating Functions. Search on Bibsonomy IPCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
Displaying result #201 - #300 of 833 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license