| |
|
James Lee: Semi Definite Extended Formulations and Sums of Squares (Part 1)
|
| | |
| |
|
Kazuo Murota: Discrete Convex Analysis (Part 1)
|
| | |
| |
|
Yin Tat Lee & Aaron Sidford: Faster Cutting Plane Methods and Improved Running Times for Submodular
|
| | |
| |
|
Jonas Witt: Dantzig Wolfe Reformulations for the Stable Set Problem
|
| | |
| |
|
Victor Chepoi: Simple connectivity, local to global, and matroids
|
| | |
| |
|
Rico Zenklusen: An O(1)-approximation for minimum spanning tree interdiction
|
| | |
| |
|
Anupam Gupta: The Independent Set problem on Degree d Graphs
|
| | |
| |
|
Sahil Singla: Online Matroid Intersection Beating Half for Random Arrival
|
| | |
| |
|
Jens Vygen: Reassembling trees for the traveling salesman
|
| | |
| |
|
Tasuku Soma: Maximizing Monotone Submodular Functions over the Integer Lattice
|
| | |
| |
|
Matthias Poloczek: New Approximation Algorithms for MAX SAT Simple, Fast, and Excellent in Practice
|
| | |
| |
|
Matthias Mnich: Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments
|
| | |
| |
|
Deeparnab Chakrabarty: Provable Submodular Function Minimization via Fujishige Wolfe Algorithm
|
| | |
| |
|
Vivek Madan: Simple and fast rounding algorithms for directed and node weighted multiway cut
|
| | |
| |
|
Heiko Röglin: Smoothed Analysis of Algorithms (Part 1)
|
| | |
| |
|
Chandra Chekuri: On element connectivity preserving graph simplification
|
| | |
| |
|
Kazuo Murota: Discrete Convex Analysis (Part 2)
|
| | |
| |
|
Kent Quanrud: Streaming Algorithms for Submodular Function Maximization
|
| | |
| |
|
Zoltán Szigeti: Connectivity Problems (Part 1)
|
| | |
| |
|
Aravind Srinivasan: Approximating integer programming problems by partial resampling
|
| | |
| |
|
Kazuo Murota: Discrete Convex Analysis (Part 3)
|
| | |
| |
|
Anja Fischer: Polynomial Matroid Optimisation Problems
|
| | |
| |
|
Monique Laurent: Convergence analysis of hierarchies for polynomial optimization
|
| | |
| |
|
András Frank: Non TDI Optimization with Supermodular Functions
|
| | |
| |
|
Linda Farczadi: The nucleolus of matching games
|
| | |
| |
|
András Sebő: Travelling salesmen on bounded degree trails
|
| | |
| |
|
Ahmad Abdi: Packing odd T-joins with at most two terminals
|
| | |
| |
|
Robert Weismantel: Affine TU decomposition of matrices
|
| | |
| |
|
Chaitanya Swamy: Signaling in Bayesian Games
|
| | |
| |
|
Agnes Cseh: Popular matchings
|
| | |
| |
|
Zeev Nutov: On LP-relaxations for the tree augmentation problem
|
| | |
| |
|
Rico Zenklusen: The Submodular Secretary Problem Goes Linear
|
| | |
| |
|
Yuval Filmus: Monotone Submodular Optimization over a Matroid
|
| | |
| |
|
Andreas E. Feldmann: A (1+ε)-embedding of low highway dimension graphs into bounded treewidth graphs
|
| | |
| |
|
Alexander Schrijver: The partially disjoint paths problem
|
| | |
| |
|
Alina Ene: The Power of Randomization Distributed Submodular Maximization on Massive Datasets
|
| | |
| |
|
Laurence Wolsey: A polyhedral approach to the maximum convex subset problem in 2-d
|
| | |
| |
|
Kazuo Murota: Extensions and Ramifications of Discrete Convexity Concepts
|
| | |
| |
|
Chidambaram Annamalai: Finding Perfect Matchings in Bipartite Hypergraphs
|
| | |
| |
|
Jon Lee: Comparing polyhedral relaxations via volume
|
| | |
| |
|
Seffi Naor: Recent Results on Maximizing Submodular Functions
|
| | |
| |
|
Wolfgang Mader: Critical vertices in k connected digraphs
|
| | |
| |
|
James Lee: Semi Definite Extended Formulations and Sums of Squares (Part 3)
|
| | |
| |
|
Gyula Pap: Linear matroid matching in the oracle model
|
| | |
| |
|
Viswanath Nagarajan: Approximation Friendly Discrepancy Rounding
|
| | |
| |
|
Zoltán Szigeti: On (2k,k)-connected graphs
|
| | |
| |
|
Monaldo Mastrolilli: On some easy problems that are hard for the Lasserre hierarchy
|
| | |
| |
|
Vahab Mirrokni: Coordination Mechanisms and Price of Anarchy via Fenchel Duality
|
| | |
| |
|
Parinya Chalermsook: Graph products, hardness of approximation, and beyond
|
| | |
| |
|
Volker Kaibel: A simple geometric proof showing that almost all 01 polytopes have exponential ...
|
| | |
| |
|
Christos Kalaitzis: Approximating the Maximum Budgeted Allocation Problem using the Configuration LP
|
| | |
| |
|
Tamás Király: Blocking optimal k arborescences
|
| | |
| |
|
M. Zadimoghaddam: Randomized Composable Core-sets for Submodular Maximization
|
| | |
| |
|
Ruta Mehta: A Market for Scheduling, with Applications to Cloud Computing
|
| | |
| |
|
Standa Zivny: The Power of Sherali Adams Relaxations for General Valued CSPs
|
| | |
| |
|
Louis Theran: Rigidity of Random Graphs in Higher Dimensions
|
| | |
| |
|
James Lee: Semi Definite Extended Formulations and Sums of Squares (Part 2)
|
| | |
| |
|
Ramamoorthi Ravi: Designing Overlapping Networks for Publish Subscribe Systems
|
| | |
| |
|
Akiyoshi Shioura: Analysis of L-convex Function Minimization Algorithms and App. to Auction Th.
|
| | |
| |
|
Heiko Röglin: Smoothed Analysis of Algorithms (Part 2)
|
| | |
| |
|
Shin-ichi Tanigawa: Sufficient Conditions for Unique Graph Realizations
|
| | |
| |
|
Edith Elkind: Coalitional Games on Sparse Social Networks
|
| | |
| |
|
Jørgen Bang-Jensen: Antistrong digraphs
|
| | |
| |
|
Tony Nixon: Rigidity of Graphs on Expanding Spheres
|
| | |
| |
|
Agnes Cseh: Paths to stable allocations
|
| | |
| |
|
Zoltán Szigeti: Connectivity Problems (Part 3)
|
| | |
| |
|
Satoru Fujishige: Combinatorial Polynomial Algorithms for Skew bisubmodular Function Minimization
|
| | |
| |
|
Rachel Cummings: The Strange Case of Privacy in Equilibrium Models
|
| | |
| |
|
Jugal Garg: ETR Completeness for Decision Versions of Multi Player Symmetric Nash Equilibria
|
| | |
| |
|
Niv Buchbinder: Deterministic Algorithms for Submodular Maximization Problems
|
| | |
| |
|
Marco Di Summa: Cut generating functions
|
| | |
| |
|
Yusuke Kobayashi: Restricted 2 matchings and Discrete Convexity
|
| | |
| |
|
Bill Jackson: Generic Rigidity of Point Line Frameworks
|
| | |
| |
|
Rahul Savani: Polymatrix Games Algorithms and Applications
|
| | |
| |
|
Kousha Etessami: The complexity of computing a quasi perfect equilibrium for n player extensive form
|
| | |
| |
|
Bernd Schulze: Characterizing Minimally Flat Symmetric Hypergraphs
|
| | |
| |
|
Dominik Peters: Structural Tractability in Hedonic Games
|
| | |
| |
|
Zoltán Szigeti: Connectivity Problems (Part 2)
|
| | |
| |
|
Csaba Király: Rigid Graphs and an Augmentation Problem
|
| | |
| |
|
Heiko Röglin: Smoothed Analysis of Algorithms (Part 3)
|
| | |
| |
|
Tom McCormick: Discrete Convexity in Supply Chain Models
|
| | |
| |
|
Hiroshi Hirai: Combinatorial algorithms for some multiflow problems and related network designs
|
| | |
| |
|
Eden Chlamtac: Lift and Project Methods and Integrality Gaps (Part 1)
|
| | |
| |
|
Troels Bjerre Lund: Timeabillity of Extensive-Form Games
|
| | |
| |
|
Daniel Dadush: On the Geometry of Linear Programming
|
| | |
| |
|
Yun Kuen (Marco) Cheung: Asynchronous Tatonnement and Coordinate Descent
|
| | |
| |
|
Tamás Király: Complexity of finding equilibria in linear service providing games
|
| | |
| |
|
Elisabeth Finhold: Circuit Diameters
|
| | |
| |
|
Ken-ichi Kawarabayashi: Deterministic edge-connectivity in near-linear time
|
| | |
| |
|
Samuel Fiorini: No Small Linear Program Approximates Vertex Cover within a Factor 2 E
|
| | |
| |
|
Anke van Zuylen: Improved approximations for cubic bipartite and cubic graph TSP
|
| | |
| |
|
Aviad Rubinstein: ETH Hardness for Symmetric Signaling in Zero Sum Games
|
| | |
| |
|
Eden Chlamtac: Lift and Project Methods and Integrality Gaps (Part 2)
|
| | |
| |
|
Gruia Calinescu: Adversary games in secure/reliable network routing
|
| | |
| |
|
Eden Chlamtac: Lift and Project Methods and Integrality Gaps (Part 3)
|
| | |
| |
|
Mohit Singh: Approximating minimum cost connectivity orientation and augmentation
|
| | |
| |
|
Nisheeth Vishnoi: Natural Algorithms for Flow Problems
|
| | |
| |
|
Matthias Mnich: Stable Marriage with Covering Constraints – A Complete Computational Trichotomy
|
| | |
| |
|
David Shmoys: Approximation algorithms for a bike sharing rebalancing problem
|
| | |
| |
|
Sylvia Boyd: Toward a 6/5 bound for the minimum cost 2-edge connected spanning subgraph problem
|
| | |
