Showing results 1 to 20 of 251
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
1-bounded space algorithms for 2-dimensional bin packing Proceeding/Conference:Lecture Notes in Computer Science | 2009 | ||
A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | ||
A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs Journal:Algorithmica (New York) | 2009 | ||
1-space bounded algorithms for 2-dimensional bin packing Proceeding/Conference:2nd Asian Association for Algorithms and Computation Meeting, AAAC 2009 | 2009 | ||
A simple algorithm for finding all k-edge-connected components Journal:PLoS ONE | 2015 | ||
Absolute and asymptotic bounds for online frequency allocation in cellular networks Journal:Algorithmica (New York) | 2010 | ||
Adaptive hierarchical vector quantization for image coding: new results Journal:Optical Engineering | 1995 | ||
Adaptive phenotype testing for AND/OR items Proceeding/Conference:Lecture Notes In Computer Science | 2011 | ||
Algorithms and Complexity for Tetrahedralization Detections Proceeding/Conference:The 13th International Symposium on Algorithms and Computation (ISAAC 2002) | 2002 | ||
Algorithms for challenging motif problems Journal:Journal of Bioinformatics and Computational Biology | 2006 | ||
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle Proceeding/Conference:Lecture Notes in Computer Science | 1997 | ||
Algorithms for Placing Monitors in a Flow Network Journal:Algorithmica | 2012 | ||
Algorithms for Placing Monitors in a Flow Network Proceeding/Conference:International Conference on Algorithmic Aspects in Information and Management Proceedings | 2009 | ||
Algorithms for updating minimal spanning trees Journal:Journal of Computer and System Sciences | 1978 | ||
ALMOST LINEAR TIME AND O(N LOG N plus E) MESSAGES DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING TREES. Proceeding/Conference:Annual Symposium on Foundations of Computer Science (Proceedings) | 1985 | ||
Approximate and dynamic rank aggregation Proceeding/Conference:Theoretical Computer Science | 2004 | ||
Approximated distributed minimum vertex cover algorithms for bounded degree graphs Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2010 | ||
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees Journal:Computational Geometry: Theory and Applications | 2005 | ||
Approximation Algorithms for Some Optimal 2D and 3D Triangulations Book:Handbook on Approximation Algorithms and Metaheuristics | 2006 | ||
Approximation and competitive algorithms for single-minded selling problem Proceeding/Conference:The Twelfth International Conference on Algorithmic Aspects in Information and Management Proceedings | 2018 |