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

• Online interval coloring with packing constraints
  Leah Epstein, Meital Levy
  Lecture Notes in Computer Science 3618, 2005, pp. 295-307
• Separating the notions of self- and autoreducibility
  Piotr Faliszewski, Mitsunori Ogihara
  Lecture Notes in Computer Science 3618, 2005, pp. 308-315
• Fully asynchronous behavior of double-quiescent elementary cellular automata
  Nazim Fatès, Michel Morvan, Nicolas Schabanel, Éric Thierry
  Lecture Notes in Computer Science 3618, 2005, pp. 316-327
• Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs
  Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
  Lecture Notes in Computer Science 3618, 2005, pp. 328-339
• Matrix and graph orders derived from locally constrained graph homomorphisms
  Jiȓí Fiala, Daniël Paulusma, Jan Arne Telle
  Lecture Notes in Computer Science 3618, 2005, pp. 340-351
• Packing weighted rectangles into a square
  Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
  Lecture Notes in Computer Science 3618, 2005, pp. 352-363
• Nondeterministic graph searching: From pathwidth to treewidth
  Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
  Lecture Notes in Computer Science 3618, 2005, pp. 364-375
• Goals in the propositional Horn^\supset language are monotone Boolean circuits
  J. Gaintzarain, M. Hermo, M. Navarro
  Lecture Notes in Computer Science 3618, 2005, pp. 376-386
• Autoreducibility, mitoticity, and immunity
  Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman, Liyu Zhang
  Lecture Notes in Computer Science 3618, 2005, pp. 387-398
• Canonical disjoint NP-pairs of propositional proof systems
  Christian Glaßer, Alan L. Selman, Liyu Zhang
  Lecture Notes in Computer Science 3618, 2005, pp. 399-409
• Complexity of DNF and isomorphism of monotone formulas
  Judy Goldsmith, Matthias Hagen, Martin Mundhenk
  Lecture Notes in Computer Science 3618, 2005, pp. 410-421
• The expressive power of two-variable least fixed-point logics
  Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
  Lecture Notes in Computer Science 3618, 2005, pp. 422-434
• Languages representable by vertex-labeled graphs
  Igor Grunsky, Oleksiy Kurganskyy, Igor Potapov
  Lecture Notes in Computer Science 3618, 2005, pp. 435-446
• On the complexity of mixed discriminants and related problems
  Leonid Gurvits
  Lecture Notes in Computer Science 3618, 2005, pp. 447-458
• Two logical hierarchies of optimization problems over the real numbers
  Uffe Flarup Hansen, Klaus Meer
  Lecture Notes in Computer Science 3618, 2005, pp. 459-470
• Algebras as knowledge structures
  Bernhard Heinemann
  Lecture Notes in Computer Science 3618, 2005, pp. 471-482
• Combining self-reducibility and partial information algorithms
  André Hernich, Arfst Nickelsen
  Lecture Notes in Computer Science 3618, 2005, pp. 483-494
• Complexity bounds for regular games
  Paul Hunter, Anuj Dawar
  Lecture Notes in Computer Science 3618, 2005, pp. 495-506
• Basic mereology with equivalence relations
  Ryszard Janicki
  Lecture Notes in Computer Science 3618, 2005, pp. 507-519
• Online and dynamic recognition of squarefree strings
  Jesper Jansson, Zeshan Peng
  Lecture Notes in Computer Science 3618, 2005, pp. 520-531
• Shrinking restarting automata
  Tomasz Jurdziński, Friedrich Otto
  Lecture Notes in Computer Science 3618, 2005, pp. 532-543
• Removing bidirectionality from nondeterministic finite automata
  Christos Kapoutsis
  Lecture Notes in Computer Science 3618, 2005, pp. 544-555
• Generating all minimal integral solutions to monotone \wedge, \vee-systems of linear, transversal and polymatroid inequalities
  L. Khachiyan, E. Boros, K. Elbassioni, V. Gurvich
  Lecture Notes in Computer Science 3618, 2005, pp. 556-567
• On the parameterized complexity of exact satisfiability problems
  Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
  Lecture Notes in Computer Science 3618, 2005, pp. 568-579
• Approximating reversal distance for strings with bounded number of duplicates
  Petr Kolman
  Lecture Notes in Computer Science 3618, 2005, pp. 580-590