Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=8037

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

On maximum weight objects decomposable into based rectilinear convex objects
Mahmuda Ahmed, Iffat Chowdhury, Matt Gibson, Mohammad Shahedul Islam, Jessica Sherrette
Lecture Notes in Computer Science 8037, 2013, pp. 1-12
Bundling three convex polygons to minimize area or perimeter
Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park
Lecture Notes in Computer Science 8037, 2013, pp. 13-24
Smart-grid electricity allocation via strip packing with slicing
Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak
Lecture Notes in Computer Science 8037, 2013, pp. 25-36
On (dynamic) range minimum queries in external memory
Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava
Lecture Notes in Computer Science 8037, 2013, pp. 37-48
Distance-sensitive planar point location
Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
Lecture Notes in Computer Science 8037, 2013, pp. 49-60
Time-space tradeoffs for all-nearest-larger-neighbors problems
Tetsuo Asano, David Kirkpatrick
Lecture Notes in Computer Science 8037, 2013, pp. 61-72
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja Knauer, Stefan Langerman, Michaƚ Lasoń, Piotr Micek, Günter Rote, Torsten Ueckerdt
Lecture Notes in Computer Science 8037, 2013, pp. 73-84
Socially stable matchings in the hospitals/residents problem
Georgios Askalidis, Nicole Immorlica, Augustine Kwanashie, David F. Manlove, Emmanouil Pountourakis
Lecture Notes in Computer Science 8037, 2013, pp. 85-96
Parameterized complexity of 1-planarity
Michael J. Bannister, Sergio Cabello, David Eppstein
Lecture Notes in Computer Science 8037, 2013, pp. 97-108
On the stretch factor of the theta-4 graph
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot
Lecture Notes in Computer Science 8037, 2013, pp. 109-120
Better space bounds for parameterized range majority and minority
Djamal Belazzougui, Travis Gagie, Gonzalo Navarro
Lecture Notes in Computer Science 8037, 2013, pp. 121-132
Online control message aggregation in chain networks
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Łukasz Jeż, Jiȓí Sgall, Grzegorz Stachowiak
Lecture Notes in Computer Science 8037, 2013, pp. 133-145
Fingerprints in compressed strings
Philip Bille, Patrick Hagge Cording, Inge Li Grtz, Benjamin Sach, Hjalte Wedel Vildhj, Sren Vind
Lecture Notes in Computer Science 8037, 2013, pp. 146-157
Beacon-based algorithms for geometric routing
Michael Biro, Justin Iwerks, Irina Kostitsyna, Joseph S.B. Mitchell
Lecture Notes in Computer Science 8037, 2013, pp. 158-169
Interval selection with machine-dependent intervals
Kateȓina Böhmová, Yann Disser, Matús̑ Mihalák, Peter Widmayer
Lecture Notes in Computer Science 8037, 2013, pp. 170-181
On the spanning ratio of theta-graphs
Prosenjit Bose, André van Renssen, Sander Verdonschot
Lecture Notes in Computer Science 8037, 2013, pp. 182-194
Relative interval analysis of paging algorithms on access graphs
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Lecture Notes in Computer Science 8037, 2013, pp. 195-206
On explaining integer vectors by few homogenous segments
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondȓej Suchý
Lecture Notes in Computer Science 8037, 2013, pp. 207-218
Trajectory grouping structure
Kevin Buchin, Maike Buchin, Marc van Kreveld, Bettina Speckmann, Frank Staals
Lecture Notes in Computer Science 8037, 2013, pp. 219-230
The art of shaving logs
Timothy M. Chan
Lecture Notes in Computer Science 8037, 2013, pp. 231-231
Treewidth and Pathwidth parameterized by the Vertex Cover Number
Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger
Lecture Notes in Computer Science 8037, 2013, pp. 232-243
Visibility and ray shooting queries in polygonal domains
Danny Z. Chen, Haitao Wang
Lecture Notes in Computer Science 8037, 2013, pp. 244-255
Lift-and-project methods for set cover and knapsack
Eden Chlamtác̑, Zachary Friggstad, Konstantinos Georgiou
Lecture Notes in Computer Science 8037, 2013, pp. 256-267
Optimal time-convex hull under the L_p metrics
Bang-Sin Dai, Mong-Jen Kao, D.T. Lee
Lecture Notes in Computer Science 8037, 2013, pp. 268-279
Blame trees
Erik D. Demaine, Pavel Panchekha, David A. Wilson, Edward Z. Yang
Lecture Notes in Computer Science 8037, 2013, pp. 280-290

Seiten 1 2 >