default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 51, 2008
Volume 51, Number 1, May 2008
- Zhi-Zhong Chen:
Approximation Algorithms for Bounded Degree Phylogenetic Roots. 1-23 - Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Connectivity Testing for Sparse Graphs. 24-48 - Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Tight Results on Minimum Entropy Set Cover. 49-60 - Christian Boulinier, Franck Petit
, Vincent Villain:
Synchronous vs. Asynchronous Unison. 61-80 - Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. 81-98
Volume 51, Number 2, June 2008
- Iyad A. Kanj, Luay Nakhleh, Ge Xia:
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. 99-128 - Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag:
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. 129-159 - Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. 160-182 - Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. 183-199 - Bernd Gärtner, Walter D. Morris Jr., Leo Rüst:
Unique Sink Orientations of Grids. 200-235
Volume 51, Number 3, July 2008
- Xiaotie Deng, Ding-Zhu Du:
Preface. 237-238 - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Generating Cut Conjunctions in Graphs and Related Problems. 239-263 - Jianxi Fan, Xiaohua Jia, Xiaola Lin:
Embedding of Cycles in Twisted Cubes with Edge-Pancyclic. 264-282 - Lusheng Wang, Kaizhong Zhang:
Space Efficient Algorithms for Ordered Tree Comparison. 283-297 - Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong:
Improved Approximate String Matching Using Compressed Suffix Data Structures. 298-314 - Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis:
A Network Game with Attackers and a Defender. 315-341 - Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. 342-356 - Li-Sha Huang:
A Primal-Dual Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions. 357-366
Volume 51, Number 4, August 2008
- Wojciech Jawor, Marek Chrobak, Christoph Dürr:
Competitive Analysis of Scheduling Algorithms for Aggregated Links. 367-386 - Camil Demetrescu, Giuseppe F. Italiano:
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure. 387-427 - Yijie Han:
An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path. 428-434 - Guojun Li, Zhijie Liu, Jun-tao Guo, Ying Xu:
An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing. 435-450 - Natalia V. Shakhlevich, Vitaly A. Strusevich:
Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times. 451-473
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
