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: Series=LNCS AND Volume=7676

• Counting partitions of graphs
  Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
  Lecture Notes in Computer Science 7676, 2012, pp. 227-236
• Constant unary constraints and symmetric real-weighted counting CSPs
  Tomoyuki Yamakami
  Lecture Notes in Computer Science 7676, 2012, pp. 237-246
• Interval scheduling and colorful independent sets
  René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
  Lecture Notes in Computer Science 7676, 2012, pp. 247-256
• More on a problem of Zarankiewicz
  Chinmoy Dutta, Jaikumar Radhakrishnan
  Lecture Notes in Computer Science 7676, 2012, pp. 257-266
• Efficient dominating and edge dominating sets for graphs and hypergraphs
  Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
  Lecture Notes in Computer Science 7676, 2012, pp. 267-277
• On the hyperbolicity of small-world and tree-like random graphs
  Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney
  Lecture Notes in Computer Science 7676, 2012, pp. 278-288
• On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets
  Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
  Lecture Notes in Computer Science 7676, 2012, pp. 289-298
• Induced immersions
  Rémy Belmonte, Pim van 't Hof, Marcin Kamiński
  Lecture Notes in Computer Science 7676, 2012, pp. 299-308
• Rectilinear covering for imprecise input points
  Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 7676, 2012, pp. 309-318
• Robust nonparametric data approximation of point sets via data reduction
  Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala
  Lecture Notes in Computer Science 7676, 2012, pp. 319-331
• Optimal point movement for covering circular regions
  Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
  Lecture Notes in Computer Science 7676, 2012, pp. 332-341
• Solving circular integral block decomposition in polynomial time
  Yunlong Liu, Xiaodong Wu
  Lecture Notes in Computer Science 7676, 2012, pp. 342-351
• The Canadian Traveller Problem revisited
  Yamming Huang, Chung-Shou Liao
  Lecture Notes in Computer Science 7676, 2012, pp. 352-361
• Vehicle scheduling on a graph revisited
  Wei Yu, Mordecai Golin, Guochuan Zhang
  Lecture Notes in Computer Science 7676, 2012, pp. 362-371
• A 4.31-approximation for the geometric unique coverage problem on unit disks
  Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
  Lecture Notes in Computer Science 7676, 2012, pp. 372-381
• The minimum vulnerability problem
  Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
  Lecture Notes in Computer Science 7676, 2012, pp. 382-391
• A strongly polynomial time algorithm for the shortest path problem on coherent planar periodic graphs
  Norie Fu
  Lecture Notes in Computer Science 7676, 2012, pp. 392-401
• Cubic augmentation of planar graphs
  Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
  Lecture Notes in Computer Science 7676, 2012, pp. 402-412
• On the number of upward planar orientations of maximal planar graphs
  Fabrizio Frati, Joachim Gudmundsson, Emo Welzl
  Lecture Notes in Computer Science 7676, 2012, pp. 413-422
• Universal point subsets for planar graphs
  Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto
  Lecture Notes in Computer Science 7676, 2012, pp. 423-432
• Abstract flows over time: A first step towards solving dynamic packing problems
  Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
  Lecture Notes in Computer Science 7676, 2012, pp. 433-443
• Extending partial representations of subclasses of chordal graphs
  Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
  Lecture Notes in Computer Science 7676, 2012, pp. 444-454
• Isomorphism for graphs of bounded connected-path-distance-width
  Yota Otachi
  Lecture Notes in Computer Science 7676, 2012, pp. 455-464
• Algorithmic aspects of the intersection and overlap numbers of a graph
  Danny Hermelin, Romeo Rizzi, Stéphane Vialette
  Lecture Notes in Computer Science 7676, 2012, pp. 465-474
• Linear layouts in submodular systems
  Hiroshi Nagamochi
  Lecture Notes in Computer Science 7676, 2012, pp. 475-484