Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Article
|
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic MatchingsAlgorithmica, 2012-08, Vol.63 (4), p.733-762 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2011 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-011-9511-8Full text available |
|
2 |
Material Type: Article
|
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious RobotsAlgorithmica, 2013-03, Vol.65 (3), p.562-583 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2012 ;2014 INIST-CNRS ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-011-9611-5Full text available |
|
3 |
Material Type: Article
|
Efficient Fully-Compressed Sequence RepresentationsAlgorithmica, 2014-05, Vol.69 (1), p.232-268 [Peer Reviewed Journal]Springer Science+Business Media New York 2012 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9726-3Full text available |
|
4 |
Material Type: Article
|
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut ProblemAlgorithmica, 2009-09, Vol.55 (1), p.1-13 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2007 ;2009 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-007-9130-6Full text available |
|
5 |
Material Type: Article
|
Graph Balancing: A Special Case of Scheduling Unrelated Parallel MachinesAlgorithmica, 2014-01, Vol.68 (1), p.62-80 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2012 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9668-9Full text available |
|
6 |
Material Type: Article
|
A Uniform Paradigm to Succinctly Encode Various Families of TreesAlgorithmica, 2014-01, Vol.68 (1), p.16-40 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2012 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9664-0Full text available |
|
7 |
Material Type: Article
|
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary DimensionsAlgorithmica, 2013-09, Vol.67 (1), p.65-88 [Peer Reviewed Journal]Springer Science+Business Media New York 2012 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9710-yFull text available |
|
8 |
Material Type: Article
|
Adaptive Drift AnalysisAlgorithmica, 2013, Vol.65 (1), p.224-250 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2011 ;2014 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-011-9585-3Full text available |
|
9 |
Material Type: Article
|
Aggregation of Partial Rankings, p-Ratings and Top-m ListsAlgorithmica, 2010-06, Vol.57 (2), p.284-300 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2008 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-008-9211-1Full text available |
|
10 |
Material Type: Article
|
Exact and Parameterized Algorithms for Max Internal Spanning TreeAlgorithmica, 2013-01, Vol.65 (1), p.95-128 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2011 ;2014 INIST-CNRS ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-011-9575-5Full text available |
|
11 |
Material Type: Article
|
On Two Techniques of Combining Branching and TreewidthAlgorithmica, 2009-06, Vol.54 (2), p.181-207 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2007 ;2009 INIST-CNRS ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-007-9133-3Full text available |
|
12 |
Material Type: Article
|
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and ExtendedAlgorithmica, 2011-11, Vol.61 (3), p.674-693 [Peer Reviewed Journal]The Author(s) 2010 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-010-9430-0Full text available |
|
13 |
Material Type: Article
|
On the Rainbow Connectivity of Graphs: Complexity and FPT AlgorithmsAlgorithmica, 2013-10, Vol.67 (2), p.161-179 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2012 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9689-4Full text available |
|
14 |
Material Type: Article
|
Approximation algorithms for connected dominating setsAlgorithmica, 1998-04, Vol.20 (4), p.374-387 [Peer Reviewed Journal]1998 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/pl00009201Full text available |
|
15 |
Material Type: Article
|
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature ProgrammingAlgorithmica, 2012-06, Vol.63 (1-2), p.117-136 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2011 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-011-9522-5Full text available |
|
16 |
Material Type: Article
|
Derandomized Constructions of k-Wise (Almost) Independent PermutationsAlgorithmica, 2009-09, Vol.55 (1), p.113-133 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2008 ;2009 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-008-9267-yFull text available |
|
17 |
Material Type: Article
|
Analysis of Agglomerative ClusteringAlgorithmica, 2014-05, Vol.69 (1), p.184-215 [Peer Reviewed Journal]Springer Science+Business Media New York 2012 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9717-4Full text available |
|
18 |
Material Type: Article
|
The relative complexity of approximate counting problemsAlgorithmica, 2004-03, Vol.38 (3), p.471-500 [Peer Reviewed Journal]2004 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-003-1073-yFull text available |
|
19 |
Material Type: Article
|
A Unified Approach to Approximating Partial Covering ProblemsAlgorithmica, 2011-04, Vol.59 (4), p.489-509 [Peer Reviewed Journal]Springer Science+Business Media, LLC 2009 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-009-9317-0Full text available |
|
20 |
Material Type: Article
|
Conflict-Free Chromatic Art Gallery CoverageAlgorithmica, 2014-01, Vol.68 (1), p.265-283 [Peer Reviewed Journal]Springer Science+Business Media New York 2013 ;2015 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9732-5Full text available |