skip to main content
Language:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters

Results 1 - 20 of 1,364  for All Library Resources

Results 1 2 3 4 5 next page
Result Number Material Type Add to My Shelf Action Record Details and Options
1
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Material Type:
Article
Add to My Research

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

Algorithmica, 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-8

Full text available

2
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
Material Type:
Article
Add to My Research

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

Algorithmica, 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-5

Full text available

3
Efficient Fully-Compressed Sequence Representations
Material Type:
Article
Add to My Research

Efficient Fully-Compressed Sequence Representations

Algorithmica, 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-3

Full text available

4
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
Material Type:
Article
Add to My Research

An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

Algorithmica, 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-6

Full text available

5
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
Material Type:
Article
Add to My Research

Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines

Algorithmica, 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-9

Full text available

6
A Uniform Paradigm to Succinctly Encode Various Families of Trees
Material Type:
Article
Add to My Research

A Uniform Paradigm to Succinctly Encode Various Families of Trees

Algorithmica, 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-0

Full text available

7
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
Material Type:
Article
Add to My Research

Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions

Algorithmica, 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-y

Full text available

8
Adaptive Drift Analysis
Material Type:
Article
Add to My Research

Adaptive Drift Analysis

Algorithmica, 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-3

Full text available

9
Aggregation of Partial Rankings, p-Ratings and Top-m Lists
Material Type:
Article
Add to My Research

Aggregation of Partial Rankings, p-Ratings and Top-m Lists

Algorithmica, 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-1

Full text available

10
Exact and Parameterized Algorithms for Max Internal Spanning Tree
Material Type:
Article
Add to My Research

Exact and Parameterized Algorithms for Max Internal Spanning Tree

Algorithmica, 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-5

Full text available

11
On Two Techniques of Combining Branching and Treewidth
Material Type:
Article
Add to My Research

On Two Techniques of Combining Branching and Treewidth

Algorithmica, 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-3

Full text available

12
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended
Material Type:
Article
Add to My Research

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended

Algorithmica, 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-0

Full text available

13
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
Material Type:
Article
Add to My Research

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms

Algorithmica, 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-4

Full text available

14
Approximation algorithms for connected dominating sets
Material Type:
Article
Add to My Research

Approximation algorithms for connected dominating sets

Algorithmica, 1998-04, Vol.20 (4), p.374-387 [Peer Reviewed Journal]

1998 INIST-CNRS ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/pl00009201

Full text available

15
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming
Material Type:
Article
Add to My Research

Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming

Algorithmica, 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-5

Full text available

16
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Material Type:
Article
Add to My Research

Derandomized Constructions of k-Wise (Almost) Independent Permutations

Algorithmica, 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-y

Full text available

17
Analysis of Agglomerative Clustering
Material Type:
Article
Add to My Research

Analysis of Agglomerative Clustering

Algorithmica, 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-4

Full text available

18
The relative complexity of approximate counting problems
Material Type:
Article
Add to My Research

The relative complexity of approximate counting problems

Algorithmica, 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-y

Full text available

19
A Unified Approach to Approximating Partial Covering Problems
Material Type:
Article
Add to My Research

A Unified Approach to Approximating Partial Covering Problems

Algorithmica, 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-0

Full text available

20
Conflict-Free Chromatic Art Gallery Coverage
Material Type:
Article
Add to My Research

Conflict-Free Chromatic Art Gallery Coverage

Algorithmica, 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-5

Full text available

Results 1 - 20 of 1,364  for All Library Resources

Results 1 2 3 4 5 next page

Searching Remote Databases, Please Wait