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
[2]
Hilfe
Suche: Author="Zhang, Guochuan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Online scheduling of mixed CPU-GPU jobs
Lin Chen
,
Deshi Ye
,
Guochuan Zhang
International Journal of Foundations of Computer Science
25
(6), 2014, pp. 745-761
A combinatorial approach for multiple RNA interaction: Formulations, approximations, and heuristics
Syed Ali Ahmed
,
Saad Mneimneh
,
Nancy L. Greenbaum
Lecture Notes in Computer Science
7936
, 2013, pp. 421-433
Recent results for online makespan minimization
Susanne Albers
Lecture Notes in Computer Science
7936
, 2013, pp. 1-3
Improved local search for universal facility location
Eric Angel
,
Nguyen Kim Thang
,
Damien Regnault
Lecture Notes in Computer Science
7936
, 2013, pp. 316-324
On the sequential price of anarchy of isolation games
Anna Angelucci
,
Vittorio Bilò
,
Michele Flammini
,
Luca Moscardelli
Lecture Notes in Computer Science
7936
, 2013, pp. 17-28
2-connecting outerplanar graphs without blowing up the pathwidth
Jasine Babu
,
Manu Basavaraju
,
Sunil Chandran Leela
,
Deepak Rajendraprasad
Lecture Notes in Computer Science
7936
, 2013, pp. 626-637
From preemptive to non-preemptive speed-scaling scheduling
Evripidis Bampis
,
Alexander Kononov
,
Dimitrios Letsios
,
Giorgio Lucarelli
,
Ioannis Nemparis
Lecture Notes in Computer Science
7936
, 2013, pp. 134-146
The discrete Voronoi game in a simple polygon
Aritra Banik
,
Sandip Das
,
Anil Maheshwari
,
Michiel Smid
Lecture Notes in Computer Science
7936
, 2013, pp. 197-207
A harmonic algorithm for the 3D strip packing problem
Nikhil Bansal
,
Xin Han
,
Kazuo Iwama
,
Maxim Sviridenko
,
Guochuan Zhang
SIAM Journal on Computing
42
(2), 2013, pp. 579-592
On linear-size pseudorandom generators and hardcore functions
Joshua Baron
,
Yuval Ishai
,
Rafail Ostrovsky
Lecture Notes in Computer Science
7936
, 2013, pp. 169-181
Covering tree with stars
Jan Baumbach
,
Jiong Guo
,
Rashid Ibragimov
Lecture Notes in Computer Science
7936
, 2013, pp. 373-384
Parameterized approximability of maximizing the spread of influence in networks
Cristina Bazgan
,
Morgan Chopin
,
André Nichterlein
,
Florian Sikora
Lecture Notes in Computer Science
7936
, 2013, pp. 543-554
The
k
-separator problem
Walid Ben-Ameur
,
Mohamed-Ahmed Mohamed-Sidi
,
José Neto
Lecture Notes in Computer Science
7936
, 2013, pp. 337-348
Community expansion model based on charged system theory
Yuanjun Bi
,
Weili Wu
,
Ailian Wang
,
Lidan Fan
Lecture Notes in Computer Science
7936
, 2013, pp. 780-790
On the advice complexity of the online
L(2,1)
-coloring problem on paths and cycles
Maria Paola Bianchi
,
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Sacha Krug
,
Björn Steffen
Lecture Notes in Computer Science
7936
, 2013, pp. 53-64
New bounds for the balloon popping problem
Davide Bilò
,
Vittorio Bilò
Lecture Notes in Computer Science
7936
, 2013, pp. 5-16
The string guessing problem as a method to prove lower bounds on the advice complexity
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Dennis Komm
,
Sacha Krug
,
Jasmin Smula
,
Andreas Sprock
Lecture Notes in Computer Science
7936
, 2013, pp. 493-505
How to catch
L_2
-heavy-hitters on sliding windows
Vladimir Braverman
,
Ran Gelles
,
Rafail Ostrovsky
Lecture Notes in Computer Science
7936
, 2013, pp. 638-650
On the complexity of solving or approximating convex recoloring problems
Manoel B. Campêlo
,
Cristiana G. Huiban
,
Rudini M. Sampaio
,
Yoshiko Wakabayashi
Lecture Notes in Computer Science
7936
, 2013, pp. 614-625
How to schedule the marketing of products with negative externalities
Zhigang Cao
,
Xujin Chen
,
Changjun Wang
Lecture Notes in Computer Science
7936
, 2013, pp. 122-133
An efficient algorithm for one-sided block ordering problem with block-interchange distance
Kun-Tze Chen
,
Chi-Long Li
,
Chung-Han Yang
,
Chin Lung Lu
Lecture Notes in Computer Science
7936
, 2013, pp. 409-420
Approximation algorithms for a bi-level knapsack problem
Lin Chen
,
Guochuan Zhang
Theoretical Computer Science
497
, 2013, pp. 1-12
Strategy-proof approximation mechanisms for an obnoxious facility game on networks
Yukun Cheng
,
Wei Yu
,
Guochuan Zhang
Theoretical Computer Science
497
, 2013, pp. 154-163
A fast algorithm for data collection along a fixed track
Otfried Cheong
,
Radwa El Shawi
,
Joachim Gudmundsson
Lecture Notes in Computer Science
7936
, 2013, pp. 77-88
Metrical service systems with multiple servers
Ashish Chiplunkar
,
Sundar Vishwanathan
Lecture Notes in Computer Science
7936
, 2013, pp. 481-492
Seiten 1
2
3
4
5
>