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

• Approximation algorithms for the b-edge dominating set problem and its related problems
  Takuro Fukunaga, Hiroshi Nagamochi
  Lecture Notes in Computer Science 3595, 2005, pp. 747-756
• Bounded degree closest k-tree power is NP-complete
  Michael Dom, Jiong Guo, Rolf Niedermeier
  Lecture Notes in Computer Science 3595, 2005, pp. 757-766
• A new algorithm for the hypergraph transversal problem
  Leonid Khachiyan, Endre Boros, Khaled Elbassioni, Vladimir Gurvich
  Lecture Notes in Computer Science 3595, 2005, pp. 767-776
• On finding a shortest path in circulant graphs with two jumps
  Domingo Gómez, Jaime Gutierrez, Álvar Ibeas, Carmen Martínez, Ramón Beivide
  Lecture Notes in Computer Science 3595, 2005, pp. 777-786
• A linear time algorithm for finding a maximal planar subgraph based on PC-trees
  Wen-Lian Hsu
  Lecture Notes in Computer Science 3595, 2005, pp. 787-797
• Algorithms for finding distance-edge-colorings of graphs
  Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 3595, 2005, pp. 798-807
• On the recognition of probe graphs of some self-complementary classes of perfect graphs
  Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng
  Lecture Notes in Computer Science 3595, 2005, pp. 808-817
• Power domination problem in graphs
  Chung-Shou Liao, Der-Tsai Lee
  Lecture Notes in Computer Science 3595, 2005, pp. 818-828
• Complexity and approximation of satisfactory partition problems
  Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
  Lecture Notes in Computer Science 3595, 2005, pp. 829-838
• Distributed weighted vertex cover via maximal matchings
  Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi
  Lecture Notes in Computer Science 3595, 2005, pp. 839-848
• On the complexity of the balanced vertex ordering problem
  Jan Kára, Jan Kratochvíl, David R. Wood
  Lecture Notes in Computer Science 3595, 2005, pp. 849-858
• An O(2^{O(k)}n^3) FPT algorithm for the undirected feedback vertex set problem
  Frank Dehne, Michael Fellows, Michael A. Langston, Frances Rosamond, Kim Stevens
  Lecture Notes in Computer Science 3595, 2005, pp. 859-869
• Approximating the longest cycle problem on graphs with bounded degree
  Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
  Lecture Notes in Computer Science 3595, 2005, pp. 870-884
• Bin packing and covering problems with rejection
  Yong He, György Dósa
  Lecture Notes in Computer Science 3595, 2005, pp. 885-894
• Query-monotonic Turing reductions
  Lane A. Hemaspaandra, Mayur Thakur
  Lecture Notes in Computer Science 3595, 2005, pp. 895-904
• On sequential and 1-deterministic P systems
  Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
  Lecture Notes in Computer Science 3595, 2005, pp. 905-914
• Global optimality conditions and near-perfect optimization in coding
  Xiaofei Huang
  Lecture Notes in Computer Science 3595, 2005, pp. 915-924
• Angel, devil, and king
  Martin Kutz, Attila Pór
  Lecture Notes in Computer Science 3595, 2005, pp. 925-934
• Overlaps help: Improved bounds for group testing with interval queries
  Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth
  Lecture Notes in Computer Science 3595, 2005, pp. 935-944
• New efficient simple authenticated key agreement protocol
  Eun-Jun Yoon, Kee-Young Yoo
  Lecture Notes in Computer Science 3595, 2005, pp. 945-954
• A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm
  Zhixiang Chen, Bin Fu
  Lecture Notes in Computer Science 3595, 2005, pp. 955-964
• The money changing problem revisited: Computing the Frobenius number in time O(k a_1)
  Sebastian Böcker, Zsuzsanna Lipták
  Lecture Notes in Computer Science 3595, 2005, pp. 965-974
• W-hardness under linear FPT-reductions: Structural properties and further applications
  Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
  Lecture Notes in Computer Science 3595, 2005, pp. 975-984
• Some new results on inverse sorting problems
  Xiao Guang Yang, Jian Zhong Zhang
  Lecture Notes in Computer Science 3595, 2005, pp. 985-992