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
[1]
Hilfe
Suche: Author="Cai, Zhipeng"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vertex cover gets faster and harder on low degree graphs
Akanksha Agrawal
,
Sathish Govindarajan
,
Neeldhara Misra
Lecture Notes in Computer Science
8591
, 2014, pp. 179-190
Partner matching applications of social networks
Chunyu Ai
,
Wei Zhong
,
Mingyuan Yan
,
Feng Gu
Lecture Notes in Computer Science
8591
, 2014, pp. 647-656
The complexity of bounded register and skew arithmetic computation
Vikraman Arvind
,
S. Raja
Lecture Notes in Computer Science
8591
, 2014, pp. 572-583
Explaining snapshots of network diffusions: Structural and hardness results
Georgios Askalidis
,
Randall A. Berry
,
Vijay G. Subramanian
Lecture Notes in Computer Science
8591
, 2014, pp. 616-625
On the kernelization complexity of string problems
Manu Basavaraju
,
Fahad Panolan
,
Ashutosh Rai
,
M.S. Ramanujan
,
Saket Saurabh
Lecture Notes in Computer Science
8591
, 2014, pp. 141-153
The range 1 query (R1Q) problem
Michael A. Bender
,
Rezaul A. Chowdhury
,
Pramod Ganapathi
,
Samuel McCauley
,
Yuan Tang
Lecture Notes in Computer Science
8591
, 2014, pp. 116-128
Minimizing average flow-time under knapsack constraint
Suman Kalyan Bera
,
Syamantak Das
,
Amit Kumar
Lecture Notes in Computer Science
8591
, 2014, pp. 584-595
Back-up 2-center on a path/tree/cycle/unicycle
Binay Bhattacharya
,
Minati De
,
Tsunehiko Kameda
,
Sasanka Roy
,
Vladyslav Sokol
,
Zhao Song
Lecture Notes in Computer Science
8591
, 2014, pp. 417-428
On the performance of mildly greedy players in cut games
Vittorio Bilò
,
Mauro Paladini
Lecture Notes in Computer Science
8591
, 2014, pp. 513-524
On linear congestion games with altruistic social context
Vittorio Bilò
Lecture Notes in Computer Science
8591
, 2014, pp. 547-558
Sampling from dense streams without penalty: Improved bounds for frequency moments and heavy hitters
Vladimir Braverman
,
Gregory Vorsanger
Lecture Notes in Computer Science
8591
, 2014, pp. 13-24
Fixed parameter tractable algorithms in combinatorial topology
Benjamin A. Burton
,
William Pettersson
Lecture Notes in Computer Science
8591
, 2014, pp. 300-311
Approximability of the minimum weighted doubly resolving set problem
Xujin Chen
,
Changjun Wang
Lecture Notes in Computer Science
8591
, 2014, pp. 357-368
Competitive cost-savings in data stream management systems
Christine Chung
,
Shenoda Guirguis
,
Anastasia Kurdia
Lecture Notes in Computer Science
8591
, 2014, pp. 129-140
Classifying the clique-width of
H
-free bipartite graphs
Konrad Kazimierz Dabrowski
,
Daniël Paulusma
Lecture Notes in Computer Science
8591
, 2014, pp. 489-500
Normal form expressions of propositional projection temporal logic
Zhenhua Duan
,
Cong Tian
,
Nan Zhang
Lecture Notes in Computer Science
8591
, 2014, pp. 84-93
Approximate sorting of data streams with limited storage
Farzad Farnoud (Hassanzadeh)
,
Eitan Yaakobi
,
Jehoshua Bruck
Lecture Notes in Computer Science
8591
, 2014, pp. 465-476
Scheduling over scenarios on two machines
Esteban Feuerstein
,
Alberto Marchetti-Spaccamela
,
Frans Schalekamp
,
René Sitters
,
Suzanne van der Ster
,
Leen Stougie
,
Anke van Zuyelen
Lecture Notes in Computer Science
8591
, 2014, pp. 559-571
Statistical properties of short RSA distribution and their cryptographic applications
Pierre-Alain Fouque
,
Jean-Christophe Zapalowicz
Lecture Notes in Computer Science
8591
, 2014, pp. 525-536
Diffuse reflection radius in a simple polygon
Eli Fox-Epstein
,
Csaba D. Tóth
,
Andrew Winslow
Lecture Notes in Computer Science
8591
, 2014, pp. 239-250
Pioneers of influence propagation in social networks
Kumar Gaurav
,
Bartƚomiej Bƚaszczyszyn
,
Paul Holger Keeler
Lecture Notes in Computer Science
8591
, 2014, pp. 626-636
Parameterized complexity of edge interdiction problems
Jiong Guo
,
Yash Raj Shrestha
Lecture Notes in Computer Science
8591
, 2014, pp. 166-178
The power of duples (in self-assembly): It's not so hip to be square
Jacob Hendricks
,
Matthew J. Patitz
,
Trent A. Rogers
,
Scott M. Summers
Lecture Notes in Computer Science
8591
, 2014, pp. 215-226
A protocol for generating random elements with their probabilities
Thomas Holenstein
,
Robin Künzler
Lecture Notes in Computer Science
8591
, 2014, pp. 191-202
A new view on worst-case to average-case reductions for NP problems
Thomas Holenstein
,
Robin Künzler
Lecture Notes in Computer Science
8591
, 2014, pp. 203-214
Seiten 1
2
3
>