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=7936

• On the conjunctive capacity of graphs
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 7936, 2013, pp. 280-291
• Improved approximation algorithms for the facility location problems with linear/submodular penalty
  Yu Li, Donglei Du, Naihua Xiu, Dachuan Xu
  Lecture Notes in Computer Science 7936, 2013, pp. 292-303
• An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
  Chenchen Wu, Donglei Du, Dachuan Xu
  Lecture Notes in Computer Science 7936, 2013, pp. 304-315
• Improved local search for universal facility location
  Eric Angel, Nguyen Kim Thang, Damien Regnault
  Lecture Notes in Computer Science 7936, 2013, pp. 316-324
• Improved approximation algorithms for computing k disjoint paths subject to two constraints
  Longkun Guo, Hong Shen, Kewen Liao
  Lecture Notes in Computer Science 7936, 2013, pp. 325-336
• The k-separator problem
  Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto
  Lecture Notes in Computer Science 7936, 2013, pp. 337-348
• On the treewidth of dynamic graphs
  Bernard Mans, Luke Mathieson
  Lecture Notes in Computer Science 7936, 2013, pp. 349-360
• Square-orthogonal drawing with few bends per edge
  Yu-An Lin, Sheung-Hung Poon
  Lecture Notes in Computer Science 7936, 2013, pp. 361-372
• Covering tree with stars
  Jan Baumbach, Jiong Guo, Rashid Ibragimov
  Lecture Notes in Computer Science 7936, 2013, pp. 373-384
• A polynomial time approximation scheme for the closest shared center problem
  Weidong Li, Lusheng Wang, Wenjuan Cui
  Lecture Notes in Computer Science 7936, 2013, pp. 385-396
• An improved approximation algorithm for scaffold filling to maximize the common adjacencies
  Nan Liu, Haitao Jiang, Daming Zhu, Binhai Zhu
  Lecture Notes in Computer Science 7936, 2013, pp. 397-408
• An efficient algorithm for one-sided block ordering problem with block-interchange distance
  Kun-Tze Chen, Chi-Long Li, Chung-Han Yang, Chin Lung Lu
  Lecture Notes in Computer Science 7936, 2013, pp. 409-420
• A combinatorial approach for multiple RNA interaction: Formulations, approximations, and heuristics
  Syed Ali Ahmed, Saad Mneimneh, Nancy L. Greenbaum
  Lecture Notes in Computer Science 7936, 2013, pp. 421-433
• Maximum balanced subgraph problem parameterized above lower bound
  Robert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia
  Lecture Notes in Computer Science 7936, 2013, pp. 434-445
• A toolbox for provably optimal multistage strict group testing strategies
  Peter Damaschke, Azam Sheikh Muhammad
  Lecture Notes in Computer Science 7936, 2013, pp. 446-457
• A linear edge kernel for two-layer crossing minimization
  Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
  Lecture Notes in Computer Science 7936, 2013, pp. 458-468
• A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product
  Christophe Crespelle, Eric Thierry, Thomas Lambert
  Lecture Notes in Computer Science 7936, 2013, pp. 469-480
• Metrical service systems with multiple servers
  Ashish Chiplunkar, Sundar Vishwanathan
  Lecture Notes in Computer Science 7936, 2013, pp. 481-492
• The string guessing problem as a method to prove lower bounds on the advice complexity
  Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
  Lecture Notes in Computer Science 7936, 2013, pp. 493-505
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
  Yong Zhang, Francis Y.L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon, Yung H. Tsin, Deshi Ye
  Lecture Notes in Computer Science 7936, 2013, pp. 506-517
• Improved lower bounds for the online bin packing problem with cardinality constraints
  Hiroshi Fujiwara, Koji Kobayashi
  Lecture Notes in Computer Science 7936, 2013, pp. 518-530
• Parameterized complexity of flood-filling games on trees
  Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva
  Lecture Notes in Computer Science 7936, 2013, pp. 531-542
• Parameterized approximability of maximizing the spread of influence in networks
  Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
  Lecture Notes in Computer Science 7936, 2013, pp. 543-554
• An effective branching strategy for some parameterized edge modification problems with multiple forbidden induced subgraphs
  Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen
  Lecture Notes in Computer Science 7936, 2013, pp. 555-566
• Parameterized algorithms for maximum agreement forest on multiple trees
  Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang
  Lecture Notes in Computer Science 7936, 2013, pp. 567-578