Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=6842

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Derandomizing HSSW algorithm for 3-SAT
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
Lecture Notes in Computer Science 6842, 2011, pp. 1-12
Dominating set counting in graph classes
Shuji Kijima, Yoshio Okamoto, Takeaki Uno
Lecture Notes in Computer Science 6842, 2011, pp. 13-24
The density maximization problem in graphs
Mong-Jen Kao, Bastian Katz, Marcus Krug, D.T. Lee, Ignaz Rutter, Dorothea Wagner
Lecture Notes in Computer Science 6842, 2011, pp. 25-36
FlipCut supertrees: Towards matrix representation accuracy in polynomial time
Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker
Lecture Notes in Computer Science 6842, 2011, pp. 37-48
Tight bounds on local search to approximate the maximum satisfiability problems
Daming Zhu, Shaohan Ma, Pingping Zhang
Lecture Notes in Computer Science 6842, 2011, pp. 49-61
Parameterized complexity in multiple-interval graphs: Partition, separation, irredundancy
Minghui Jiang, Yong Zhang
Lecture Notes in Computer Science 6842, 2011, pp. 62-73
Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint sum
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Francis C.M. Lau
Lecture Notes in Computer Science 6842, 2011, pp. 74-85
On the rainbow connectivity of graphs: Complexity and FPT algorithms
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
Lecture Notes in Computer Science 6842, 2011, pp. 86-97
On parameterized independent feedback vertex set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
Lecture Notes in Computer Science 6842, 2011, pp. 98-109
Cograph editing: Complexity and parameterized algorithms
Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen
Lecture Notes in Computer Science 6842, 2011, pp. 110-121
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Tomoyuki Yamakami
Lecture Notes in Computer Science 6842, 2011, pp. 122-133
Strong I/O lower bounds for binomial and FFT computation graphs
Desh Ranjan, John Savage, Mohammad Zubair
Lecture Notes in Computer Science 6842, 2011, pp. 134-145
Spin systems on graphs with complex edge functions and specified degree regularities
Jin-Yi Cai, Michael Kowalczyk
Lecture Notes in Computer Science 6842, 2011, pp. 146-157
Quantum algorithm for the Boolean hidden shift problem
Dmitry Gavinsky, Martin Roetteler, Jérémie Roland
Lecture Notes in Computer Science 6842, 2011, pp. 158-167
A Kolmogorov complexity proof of the Lovász local lemma for satisfiability
Jochen Messner, Thomas Thierauf
Lecture Notes in Computer Science 6842, 2011, pp. 168-179
Proper n-cell polycubes in n-3 dimensions
Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote
Lecture Notes in Computer Science 6842, 2011, pp. 180-191
Largest area convex hull of axis-aligned squares based on imprecise data
Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu
Lecture Notes in Computer Science 6842, 2011, pp. 192-203
Improved algorithms for the point-set embeddability problem for plane 3-trees
Tanaeem M. Moosa, M. Sohel Rahman
Lecture Notes in Computer Science 6842, 2011, pp. 204-212
Optimal strategies for the one-round discrete Voronoi game on a line
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
Lecture Notes in Computer Science 6842, 2011, pp. 213-224
Computing the girth of a planar graph in linear time
Hsien-Chih Chang, Hsueh-I Lu
Lecture Notes in Computer Science 6842, 2011, pp. 225-236
Diagonalization strikes back: Some recent lower bounds in complexity theory
Ryan Williams
Lecture Notes in Computer Science 6842, 2011, pp. 237-239
Unions of disjoint NP-complete sets
Christian Glaßer, John M. Hitchcock, A. Pavan, Stephen Travers
Lecture Notes in Computer Science 6842, 2011, pp. 240-251
ReachFewL = ReachUL
Brady Garvin, Derrick Stolee, Raghunath Tewari, N.V. Vinodchandran
Lecture Notes in Computer Science 6842, 2011, pp. 252-258
(1+\epsilon)-competitive algorithm for online OVSF code assignment with resource augmentation
Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
Lecture Notes in Computer Science 6842, 2011, pp. 259-270
Scheduling jobs on heterogeneous platforms
Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
Lecture Notes in Computer Science 6842, 2011, pp. 271-283

Seiten 1 2 3 >