Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 56, 2010
Volume 56, Number 1, January 2010
- Takeshi Tokuyama
:
Foreword. 1-2 - Takeaki Uno:
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem. 3-16 - Hiroshi Nagamochi:
Minimum Degree Orderings. 17-34 - Anna Urbanska:
Faster Combinatorial Algorithms for Determinant and Pfaffian. 35-50 - Thomas Sauerwald:
On Mixing and Edge Expansion Properties in Randomized Broadcasting. 51-88 - Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
A Constant-Competitive Algorithm for Online OVSF Code Assignment. 89-104 - M. Ziaur Rahman, J. Ian Munro:
Integer Representation and Counting in the Bit Probe Model. 105-127
Volume 56, Number 2, February 2010
- L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes. 129-140 - Nicolas Broutin, Luc Devroye, Erin McLeish:
Note on the Structure of Kruskal's Algorithm. 141-159 - Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel:
Augmenting the Connectivity of Outerplanar Graphs. 160-179 - Piotr Sankowski, Marcin Mucha:
Fast Dynamic Transitive Closure with Lookahead. 180-197 - Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Requirement Cut on Graphs. 198-213 - Amihood Amir, Eran Chencinski:
Faster Two Dimensional Scaled Matching. 214-234 - Maarten Löffler, Marc J. van Kreveld:
Largest and Smallest Convex Hulls for Imprecise Points. 235-269 - Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang:
On the Longest Common Rigid Subsequence Problem. 270-280
Volume 56, Number 3, March 2010
- Xiaodong Hu, Jie Wang:
Recent Advances in Computation and Combinatorial Optimization. 281-282 - Jianxin Wang, Minzhu Xie, Jianer Chen:
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. 283-296 - Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su:
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. 297-312 - Epameinondas Fritzilas, Martin Milanic, Sven Rahmann, Yasmín Á. Ríos-Solís:
Structural Identifiability in Low-Rank Matrix Factorization. 313-332 - Xianyue Li, Feng Zou, Yaochun Huang, Donghyun Kim, Weili Wu:
A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree. 333-341 - Ulrich Hertrampf, Christoph Minnameier:
Resource Bounded Frequency Computations with Three Errors. 342-363 - Xi Chen, Xiaoming Sun, Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation. 364-382
Volume 56, Number 4, April 2010
- Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca:
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. 383-393 - Vladimir Kolmogorov:
A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph. 394-412 - Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi:
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. 413-436 - Satoru Iwata, Yusuke Kobayashi:
An Algorithm for Minimum Cost Arc-Connectivity Orientations. 437-447 - Eyal Amir:
Approximation Algorithms for Treewidth. 448-479 - Sudheer Sahu, John H. Reif:
Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly. 480-504 - Leah Epstein:
Bin Packing with Rejection Revisited. 505-528 - Danny Segev, Gil Segev:
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. 529-549 - Antonio Fernández, Ernesto Jiménez, Michel Raynal, Gilles Trédan:
A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems. 550-576 - Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 Spreading Metrics for Vertex Ordering Problems. 577-604 - Chris Studholme, Ian F. Blake:
Random Matrices and Codes for the Erasure Channel. 605-620
a service of 
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 2024-04-25 21:54 CEST 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:
