Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Booktitle=Proceedings of the 18th Annual International Conference on Computing and Combinatorics, COCOON'2012 (Sydney, Australia, August 20-22, 2012)

• A linear time algorithm for computing minmax regret 1-median on a tree
  Binay Bhattacharya, Tsunehiko Kameda
  Lecture Notes in Computer Science 7434, 2012, pp. 1-12
• A simple D^2-sampling based PTAS for k-means and other clustering problems
  Ragesh Jaiswal, Amit Kumar, Sandeep Sen
  Lecture Notes in Computer Science 7434, 2012, pp. 13-24
• Speed scaling for maximum lateness
  Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois
  Lecture Notes in Computer Science 7434, 2012, pp. 25-36
• Induced subgraph isomorphism: Are some patterns substantially easier than others?
  Peter Floderus, Mirosƚaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
  Lecture Notes in Computer Science 7434, 2012, pp. 37-48
• Contiguous minimum single-source-multi-sink cuts in weighted planar graphs
  Ivona Bezáková, Zachary Langley
  Lecture Notes in Computer Science 7434, 2012, pp. 49-60
• Online knapsack problem with removal cost
  Xin Han, Yasushi Kawase, Kazuhisa Makino
  Lecture Notes in Computer Science 7434, 2012, pp. 61-73
• An improved exact algorithm for TSP in degree-4 graphs
  Mingyu Xiao, Hiroshi Nagamochi
  Lecture Notes in Computer Science 7434, 2012, pp. 74-85
• Dynamic programming for H-minor-free graphs
  Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 7434, 2012, pp. 86-97
• Restricted max-min fair allocations with inclusion-free intervals
  Monaldo Mastrolilli, Georgios Stamoulis
  Lecture Notes in Computer Science 7434, 2012, pp. 98-108
• An improved algorithm for packing T-paths in inner Eulerian networks
  Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov
  Lecture Notes in Computer Science 7434, 2012, pp. 109-120
• Towards optimal and expressive kernelization for d-Hitting Set
  René van Bevern
  Lecture Notes in Computer Science 7434, 2012, pp. 121-132
• Maximum number of minimal feedback vertex sets in chordal graphs and cographs
  Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yingve Villanger
  Lecture Notes in Computer Science 7434, 2012, pp. 133-144
• A local algorithm for finding dense bipartite-like subgraphs
  Pan Peng
  Lecture Notes in Computer Science 7434, 2012, pp. 145-156
• Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
  Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang
  Lecture Notes in Computer Science 7434, 2012, pp. 157-168
• On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
  Biing-Feng Wang, Chih-Hsuan Li
  Lecture Notes in Computer Science 7434, 2012, pp. 169-180
• Rainbow colouring of split and threshold graphs
  L. Sunil Chandran, Deepak Rajendraprasad
  Lecture Notes in Computer Science 7434, 2012, pp. 181-192
• Approximating the rainbow - Better lower and upper bounds
  Alexandru Popa
  Lecture Notes in Computer Science 7434, 2012, pp. 193-203
• Ramsey numbers for line graphs and perfect graphs
  Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei
  Lecture Notes in Computer Science 7434, 2012, pp. 204-215
• Geodesic order types
  Oswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber
  Lecture Notes in Computer Science 7434, 2012, pp. 216-227
• Computing partitions of rectilinear polygons with minimum stabbing number
  Stephane Durocher, Saeed Mehrabi
  Lecture Notes in Computer Science 7434, 2012, pp. 228-239
• Monotone paths in planar convex subdivisions
  Adrian Dumitrescu, Günter Rote, Csaba D. Tóth
  Lecture Notes in Computer Science 7434, 2012, pp. 240-251
• The cost of bounded curvature
  Hyo-Sil Kim, Otfried Cheong
  Lecture Notes in Computer Science 7434, 2012, pp. 252-263
• Optimally solving a transportation problem using Voronoi diagrams
  Darius Geiß, Rolf Klein, Rainer Penninger
  Lecture Notes in Computer Science 7434, 2012, pp. 264-274
• Unexplored Steiner ratios in geometric networks
  Paz Carmi, Lilach Chaitman-Yerushalmi
  Lecture Notes in Computer Science 7434, 2012, pp. 275-286
• Geometric RAC simultaneous drawings of graphs
  Evmorfia Argyriou, Michael Bekos, Michael Kaufmann, Antonios Symvonis
  Lecture Notes in Computer Science 7434, 2012, pp. 287-298