Abstract is missing.
- Region-fault tolerant geometric spannersMohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson. 1-10 [doi]
- A PTAS for TSP with neighborhoods among fat regions in the planeJoseph S. B. Mitchell. 11-18 [doi]
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisionsYoav Giyora, Haim Kaplan. 19-28 [doi]
- Squarepants in a tree: sum of subtree clustering and hyperbolic pants decompositionDavid Eppstein. 29-38 [doi]
- A near linear time constant factor approximation for Euclidean bichromatic matching (cost)Piotr Indyk. 39-42 [doi]
- Compacting cuts: a new linear formulation for minimum cutRobert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh. 43-52 [doi]
- Linear programming relaxations of maxcutWenceslas Fernandez de la Vega, Claire Kenyon-Mathieu. 53-61 [doi]
- Near-optimal algorithms for maximum constraint satisfaction problemsMoses Charikar, Konstantin Makarychev, Yury Makarychev. 62-68 [doi]
- Improved bounds for the symmetric rendezvous value on the lineQiaoming Han, Donglei Du, Juan Vera, Luis F. Zuluaga. 69-78 [doi]
- Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimizationFabián A. Chudak, Kiyohito Nagano. 79-88 [doi]
- Multiple source shortest paths in a genus g graphSergio Cabello, Erin W. Chambers. 89-97 [doi]
- Obnoxious centers in graphsSergio Cabello, Günter Rote. 98-107 [doi]
- Maximum matching in graphs with an excluded minorRaphael Yuster, Uri Zwick. 108-117 [doi]
- Faster dynamic matchings and vertex connectivityPiotr Sankowski. 118-126 [doi]
- Efficient algorithms for computing all low ::::s-t:::: edge connectivities and related problemsRamesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi. 127-136 [doi]
- Analytic combinatorics: a calculus of discrete structuresPhilippe Flajolet. 137-148 [doi]
- Equilibria in online gamesRoee Engelberg, Joseph Naor. 149-158 [doi]
- The approximation complexity of win-lose gamesXi Chen, Shang-Hua Teng, Paul Valiant. 159-168 [doi]
- Convergence to approximate Nash equilibria in congestion gamesSteve Chien, Alistair Sinclair. 169-178 [doi]
- Efficient contention resolution protocols for selfish agentsAmos Fiat, Yishay Mansour, Uri Nadav. 179-188 [doi]
- Strong price of anarchyNir Andelman, Michal Feldman, Yishay Mansour. 189-198 [doi]
- Better online buffer managementFei Li, Jay Sethuraman, Clifford Stein. 199-208 [doi]
- Considering suppressed packets improves buffer management in QoS switchesMatthias Englert, Matthias Westermann. 209-218 [doi]
- Instability of FIFO in the permanent sessions model at arbitrarily small network loadsMatthew Andrews. 219-228 [doi]
- On the separation and equivalence of paging strategiesSpyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz. 229-237 [doi]
- Pull-based data broadcast with dependencies: be fair to users, not to itemsJulien Robert, Nicolas Schabanel. 238-247 [doi]
- Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetrySpyros Angelopoulos. 248-257 [doi]
- Minimizing movementErik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam. 258-267 [doi]
- Optimization problems in multiple-interval graphsAyelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz. 268-277 [doi]
- Approximation algorithms via contraction decompositionErik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar. 278-287 [doi]
- A 1.875: approximation algorithm for the stable marriage problemKazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi. 288-297 [doi]
- Improved algorithms for path, matching, and packing problemsJianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang. 298-307 [doi]
- Model-driven optimization using adaptive probesSudipto Guha, Kamesh Munagala. 308-317 [doi]
- Estimating the sortedness of a data streamParikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar. 318-327 [doi]
- A near-optimal algorithm for computing the entropy of a streamAmit Chakrabarti, Graham Cormode, Andrew McGregor. 328-335 [doi]
- The communication and streaming complexity of computing the longest common and increasing subsequencesXiaoming Sun, David P. Woodruff. 336-345 [doi]
- Efficient aggregation algorithms for probabilistic dataT. S. Jayram, Satyen Kale, Erik Vee. 346-355 [doi]
- An unbiased pointing operator for unlabeled structures, with applications to counting and samplingManuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske. 356-365 [doi]
- Approximating entropy from sublinear samplesMickey Brautbar, Alex Samorodnitsky. 366-375 [doi]
- Torpid mixing of local Markov chains on 3-colorings of the discrete torusDavid Galvin, Dana Randall. 376-384 [doi]
- Probabilistic analysis of linear programming decodingConstantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. 385-394 [doi]
- Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codesAdam Smith. 395-404 [doi]
- Deterministic pivoting algorithms for constrained ranking and clustering problemsAnke van Zuylen, Rajneesh Hegde, Kamal Jain, David P. Williamson. 405-414 [doi]
- Aggregation of partial rankings, ::::p::::-ratings and top-::::m:::: listsNir Ailon. 415-424 [doi]
- Algorithms and incentives for robust rankingRajat Bhattacharjee, Ashish Goel. 425-433 [doi]
- Matroids, secretary problems, and online mechanismsMoshe Babaioff, Nicole Immorlica, Robert Kleinberg. 434-443 [doi]
- An algebraic algorithm for weighted linear matroid intersectionNicholas J. A. Harvey. 444-453 [doi]
- An elementary construction of constant-degree expandersNoga Alon, Oded Schwartz, Asaf Shapira. 454-458 [doi]
- The ::::k::::-orientability thresholds for ::::G::::::::::n, p::::::Daniel Fernholz, Vijaya Ramachandran. 459-468 [doi]
- The random graph threshold for ::::k::::-orientiability and a fast algorithm for optimal multiple-choice allocationJulie Anne Cain, Peter Sanders, Nicholas C. Wormald. 469-476 [doi]
- On extremal subgraphs of random graphsGraham Brightwell, Konstantinos Panagiotou, Angelika Steger. 477-485 [doi]
- Online vertex colorings of random graphs without monochromatic subgraphsMartin Marciniszyn, Reto Spöhel. 486-493 [doi]
- On testable properties in bounded degree graphsArtur Czumaj, Christian Sohler. 494-501 [doi]
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortionIttai Abraham, Yair Bartal, Ofer Neiman. 502-511 [doi]
- Approximation algorithms for embedding general metrics into treesMihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos. 512-521 [doi]
- Efficient subspace approximation algorithmsNariankadu D. Shyamalkumar, Kasturi R. Varadarajan. 532-540 [doi]
- A divide and conquer algorithm for ::::d::::-dimensional arrangementMoses Charikar, Konstantin Makarychev, Yury Makarychev. 541-546 [doi]
- Resilient search treesIrene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano. 547-553 [doi]
- Randomization does not help searching predecessorsMihai Patrascu, Mikkel Thorup. 555-564 [doi]
- Dynamic weighted ancestorsTsvi Kopelowitz, Moshe Lewenstein. 565-574 [doi]
- Ultra-succinct representation of ordered treesJesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. 575-584 [doi]
- Tree exploration with logarithmic memoryLeszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang. 585-594 [doi]
- Testing for a thetaMaria Chudnovsky, Paul D. Seymour. 595-598 [doi]
- Deterministic rendezvous, treasure hunts and strongly universal exploration sequencesAmnon Ta-Shma, Uri Zwick. 599-608 [doi]
- Planar graphs are in 1-STRINGJérémie Chalopin, Daniel Gonçalves, Pascal Ochem. 609-617 [doi]
- On the bandwidth conjecture for 3-colourable graphsJulia Böttcher, Mathias Schacht, Anusch Taraz. 618-626 [doi]
- Sandpile transience on the grid is polynomially boundedLászló Babai, Igor Gorodezky. 627-636 [doi]
- Digraph measures: Kelly decompositions, games, and orderingsPaul Hunter, Stephan Kreutzer. 637-644 [doi]
- Approximating the spanning star forest problem and its applications to genomic sequence alignmentC. Thach Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, Louxin Zhang. 645-654 [doi]
- Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigreeJing Xiao, Lan Liu, Lirong Xia, Tao Jiang. 655-664 [doi]
- Whole genome duplications, multi-break rearrangements, and genome halving problemMax A. Alekseyev, Pavel A. Pevzner. 665-679 [doi]
- Succinct indexes for strings, binary relations and multi-labeled treesJérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao. 680-689 [doi]
- A simple storage scheme for strings achieving entropy boundsPaolo Ferragina, Rossano Venturini. 690-696 [doi]
- A network formation game for bipartite exchange economiesEyal Even-Dar, Michael J. Kearns, Siddharth Suri. 697-706 [doi]
- Cheap labor can be expensiveNing Chen, Anna R. Karlin. 707-715 [doi]
- Buying cheap is expensive: hardness of non-parametric multi-product pricingPatrick Briest, Piotr Krysta. 716-725 [doi]
- Dynamic pricing for impatient biddersNikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko. 726-735 [doi]
- Designing and learning optimal finite support auctionsEdith Elkind. 736-745 [doi]
- On Bregman Voronoi diagramsFrank Nielsen, Jean-Daniel Boissonnat, Richard Nock. 746-755 [doi]
- Zone diagrams: existence, uniqueness and algorithmic challengeTetsuo Asano, Jirí Matousek, Takeshi Tokuyama. 756-765 [doi]
- Approximate shortest paths in anisotropic regionsSiu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang. 766-774 [doi]
- On bounded leg shortest paths problemsLiam Roditty, Michael Segal. 775-784 [doi]
- Counting colors in boxesHaim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin. 785-794 [doi]
- Energy efficient online deadline schedulingHo-Leung Chan, Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong. 795-804 [doi]
- Speed scaling for weighted flow timeNikhil Bansal, Kirk Pruhs, Clifford Stein. 805-813 [doi]
- Path-independent load balancing with unreliable machinesJames Aspnes, Yang Richard Yang, Yitong Yin. 814-823 [doi]
- Layered multicast scheduling for the L::infinity:: objectiveQingbo Cai, Vincenzo Liberatore. 824-833 [doi]
- Lower bounds on average-case delay for video-on-demand broadcast protocolsWei-Lung Dustin Tseng, David G. Kirkpatrick. 834-842 [doi]
- Maximum ::::s-t::::-flow with ::::k:::: crossings in ::::O::::(::::k:::::::3:::::::n:::: log ::::n::::) timeJan M. Hochstein, Karsten Weihe. 843-847 [doi]
- Matrix scaling by network flowGünter Rote, Martin Zachariasen. 848-854 [doi]
- Single source multiroute flows and cuts on uniform capacity networksHenning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman. 855-863 [doi]
- Island hopping and path colouring with applications to WDM network designAndrew McGregor, Bruce Shepherd. 864-873 [doi]
- Maximum independent sets in graphs of low degreeVadim V. Lozin, Martin Milanic. 874-880 [doi]
- Noisy binary search and its applicationsRichard M. Karp, Robert Kleinberg. 881-890 [doi]
- Multiple choice tries and distributed hash tablesLuc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski. 891-899 [doi]
- Making deterministic signatures quicklyMilan Ruzic. 900-909 [doi]
- A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengthsLuca Allulli, Peter Lichodzijewski, Norbert Zeh. 910-919 [doi]
- On the ::::K::::-simple shortest paths problem in weighted directed graphsLiam Roditty. 920-928 [doi]
- Semi-oblivious routing: lower boundsMohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton. 929-938 [doi]
- Optimal scale-free compact routing schemes in networks of low doubling dimensionGoran Konjevod, Andréa W. Richa, Donglin Xia. 939-948 [doi]
- Distributed algorithms for multicommodity flow problems via approximate steepest descent frameworkBaruch Awerbuch, Rohit Khandekar, Satish Rao. 949-957 [doi]
- Network sketching or: How Much Geometry Hides in Connectivity?--Part II Stefan Funke, Nikola Milosavljevic. 958-967 [doi]
- Line-of-sight networksAlan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany. 968-977 [doi]
- All-pairs bottleneck paths in vertex weighted graphsAsaf Shapira, Raphael Yuster, Uri Zwick. 978-985 [doi]
- Finding a heaviest triangle is not harder than matrix multiplicationArtur Czumaj, Andrzej Lingas. 986-994 [doi]
- Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)Ryan Williams. 995-1001 [doi]
- A linear work, O(n:::1/6:::) time, parallel algorithm for solving planar LaplaciansIoannis Koutis, Gary L. Miller. 1002-1011 [doi]
- Fast computation of power series solutions of systems of differential equationsAlin Bostan, Frédéric Chyzak, François Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic. 1012-1021 [doi]
- Combinatorial algorithms for web search engines: three success storiesMonika Rauch Henzinger. 1022-1026 [doi]
- k-means++: the advantages of careful seedingDavid Arthur, Sergei Vassilvitskii. 1027-1035 [doi]
- Spectral clustering with limited independenceAnirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra. 1036-1045 [doi]
- A rigorous analysis of population stratification with limited dataKamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou. 1046-1055 [doi]
- Restricted strip covering and the sensor cover problemAdam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi. 1056-1063 [doi]
- Compressing rectilinear pictures and minimizing access control listsDavid Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang. 1066-1075 [doi]
- Reconstruction using witness complexesLeonidas J. Guibas, Steve Oudot. 1076-1085 [doi]
- Geometric and topological guarantees for the WRAP reconstruction algorithmEdgar A. Ramos, Bardia Sadri. 1086-1095 [doi]
- Delaunay refinement for piecewise smooth complexesSiu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos. 1096-1105 [doi]
- Complexity of Delaunay triangulation for points on lower-dimensional polyhedraNina Amenta, Dominique Attali, Olivier Devillers. 1106-1113 [doi]
- On the number of tetrahedra with minimum, unit, and distinct volumes in three-spaceAdrian Dumitrescu, Csaba D. Tóth. 1114-1123 [doi]
- Games of fixed rank: a hierarchy of bimatrix gamesRavi Kannan, Thorsten Theobald. 1124-1132 [doi]
- The effectiveness of Stackelberg strategies and tolls for network congestion gamesChaitanya Swamy. 1133-1142 [doi]
- Setting lower bounds on truthfulness: extended abstractAhuva Mu alem, Michael Schapira. 1143-1152 [doi]
- An efficient cost-sharing mechanism for the prize-collecting Steiner forest problemAnupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer. 1153-1162 [doi]
- A lower bound for scheduling mechanismsGeorge Christodoulou, Elias Koutsoupias, Angelina Vidali. 1163-1170 [doi]
- The independent even factor problemSatoru Iwata, Kenjiro Takazawa. 1171-1180 [doi]
- Fractional packing in ideal cluttersYuji Matsuoka. 1181-1186 [doi]
- Half integral packing, Erdős-Posá-property and graph minorsKen-ichi Kawarabayashi. 1187-1196 [doi]
- Harmonic algorithm for 3-dimensional strip packing problemNikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang. 1197-1206 [doi]
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problemsDavid R. Karger, Krzysztof Onak. 1207-1216 [doi]
- Quantum algorithms for Simon s problem over general groupsGorjan Alagic, Cristopher Moore, Alexander Russell. 1217-1224 [doi]
- Quantum algorithm for a generalized hidden shift problemAndrew M. Childs, Wim van Dam. 1225-1232 [doi]
- The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuitsDave Bacon, Isaac L. Chuang, Aram Wettroth Harrow. 1235-1244 [doi]
- Correlation decay and deterministic FPTAS for counting list-colorings of a graphDavid Gamarnik, Dmitriy Katz. 1245-1254 [doi]
- Counting good truth assignments of random ::::k::::-SAT formulaeAndrea Montanari, Devavrat Shah. 1255-1264 [doi]
- Approximation algorithms for node-weighted buy-at-bulk network designChandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. 1265-1274 [doi]
- Approximation algorithms for prize collecting forest problems with submodular penalty functionsYogeshwer Sharma, Chaitanya Swamy, David P. Williamson. 1275-1284 [doi]
- A polynomial-time approximation scheme for Steiner tree in planar graphsGlencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein. 1285-1294 [doi]
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstractMatthias Englert, Heiko Röglin, Berthold Vöcking. 1295-1304 [doi]
- Approximation algorithms for stochastic and risk-averse optimizationAravind Srinivasan. 1305-1313 [doi]