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 YEAR=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a generalization of the Master Cyclic Group Polyhedron
Sanjeeb Dash
,
Ricardo Fukasawa
,
Oktay Günlük
Lecture Notes in Computer Science
4513
, 2007, pp. 197-209
Generating multiple solutions for mixed integer programming problems
Emilie Danna
,
Mary Fenelon
,
Zonghao Gu
,
Roland Wunderling
Lecture Notes in Computer Science
4513
, 2007, pp. 280-294
Mixed-integer vertex covers on bipartite graphs
Michele Conforti
,
Bert Gerards
,
Giacomo Zambelli
Lecture Notes in Computer Science
4513
, 2007, pp. 324-336
On the MIR closure of polyhedra
Sanjeeb Dash
,
Oktay Günlük
,
Andrea Lodi
Lecture Notes in Computer Science
4513
, 2007, pp. 337-351
The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows
Michele Conforti
,
Marco Di Summa
,
Laurence A. Wolsey
Lecture Notes in Computer Science
4513
, 2007, pp. 352-366
Infrastructure leasing problems
Barbara M. Anthony
,
Anupam Gupta
Lecture Notes in Computer Science
4513
, 2007, pp. 424-438
A calculus and algebra for distributed data management
Serge Abiteboul
Lecture Notes in Computer Science
4393
, 2007, pp. 1-11
Compact forbidden-set routing
Bruno Courcelle
,
Andrew Twigg
Lecture Notes in Computer Science
4393
, 2007, pp. 37-48
Wavelength management in WDM rings to maximize the number of connections
Ioannis Caragiannis
Lecture Notes in Computer Science
4393
, 2007, pp. 61-72
A first investigation of Sturmian trees
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
Lecture Notes in Computer Science
4393
, 2007, pp. 73-84
Correlations of partial words
Francine Blanchet-Sadri
,
Joshua D. Gafni
,
Kevin H. Wilson
Lecture Notes in Computer Science
4393
, 2007, pp. 97-108
Why almost all
k
-colorable graphs are easy
Amin Coja-Oghlan
,
Michael Krivelevich
,
Dan Vilenchik
Lecture Notes in Computer Science
4393
, 2007, pp. 121-132
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
Peter Bürgisser
Lecture Notes in Computer Science
4393
, 2007, pp. 133-144
Broadcasting vs. mixing and information dissemination on Cayley graphs
Robert Elsässer
,
Thomas Sauerwald
Lecture Notes in Computer Science
4393
, 2007, pp. 163-174
Light orthogonal networks with constant geometric dilation
Adrian Dumitrescu
,
Csaba D. Tóth
Lecture Notes in Computer Science
4393
, 2007, pp. 175-187
Admissibility in infinite games
Dietmar Berwanger
Lecture Notes in Computer Science
4393
, 2007, pp. 188-199
Symmetries and the complexity of pure Nash equilibrium
Felix Brandt
,
Felix Fischer
,
Markus Holzer
Lecture Notes in Computer Science
4393
, 2007, pp. 212-223
Kolmogorov-Loveland stochasticity and Kolmogorov complexity
Laurent Bienvenu
Lecture Notes in Computer Science
4393
, 2007, pp. 260-271
A cubic kernel for feedback vertex set
Hans L. Bodlaender
Lecture Notes in Computer Science
4393
, 2007, pp. 320-331
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Peter Damaschke
Lecture Notes in Computer Science
4393
, 2007, pp. 332-343
On the complexity of unary tiling-recognizable picture languages
Alberto Bertoni
,
Massimiliano Goldwurm
,
Violetta Lonati
Lecture Notes in Computer Science
4393
, 2007, pp. 381-392
On symmetric signatures in holographic algorithms
Jin-Yi Cai
,
Pinyan Lu
Lecture Notes in Computer Science
4393
, 2007, pp. 429-440
Randomly rounding rationals with cardinality constraints and derandomizations
Benjamin Doerr
Lecture Notes in Computer Science
4393
, 2007, pp. 441-452
A deterministic algorithm for summarizing asynchronous streams over a sliding window
Costas Busch
,
Srikanta Tirthapura
Lecture Notes in Computer Science
4393
, 2007, pp. 465-476
The polynomially bounded perfect matching problem is in
NC^2
Manindra Agrawal
,
Thanh Minh Hoang
,
Thomas Thierauf
Lecture Notes in Computer Science
4393
, 2007, pp. 489-499
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>