Facet browsing currently unavailable
Page 8 of 966 results
Sort by: relevance publication year
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems JOURNAL ARTICLE published 30 April 2020 in ACM Transactions on Algorithms |
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem JOURNAL ARTICLE published June 2008 in ACM Transactions on Algorithms |
PTAS for Sparse General-valued CSPs JOURNAL ARTICLE published 30 April 2023 in ACM Transactions on Algorithms Research funded by UKRI (EP/X024431/1) | European Union’s Horizon 2020 research and innovation programme (714532) |
Exact Algorithms for Terrain Guarding JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Algorithms Research funded by ERC (306992 (S.S.)) | European Research Council under the European Union's Seventh Framework Programme (FP/2007-2013) |
The relative worst order ratio applied to seat reservation JOURNAL ARTICLE published August 2008 in ACM Transactions on Algorithms |
Flow-augmentation II: Undirected Graphs JOURNAL ARTICLE published 30 April 2024 in ACM Transactions on Algorithms Research funded by European Union’s Horizon 2020 (714704) | French National Research Agency (ANR-18-CE40-0025-01) |
Counting Homomorphic Cycles in Degenerate Graphs JOURNAL ARTICLE published 31 January 2023 in ACM Transactions on Algorithms Research funded by ERC Consolidator (863438) | NSF-BSF (20196) |
Finding one tight cycle JOURNAL ARTICLE published August 2010 in ACM Transactions on Algorithms Research funded by Javna Agencija za Raziskovalno Dejavnost RS (J1-7218P1-0297) |
Finding shortest contractible and shortest separating cycles in embedded graphs JOURNAL ARTICLE published March 2010 in ACM Transactions on Algorithms |
Fault-Tolerant Approximate BFS Structures JOURNAL ARTICLE published 31 January 2018 in ACM Transactions on Algorithms Research funded by United States-Israel Binational Science Foundation (2008348) | ISF (4/11) | Israel Science Foundation (894/09) |
Subtree Isomorphism Revisited JOURNAL ARTICLE published 31 July 2018 in ACM Transactions on Algorithms Research funded by BSF (BSF:2012338) | Carlsberg Foundation (CF14-0617) | NSF (CCF-1417238 and CCF-1514339) | Israeli Centers of Research Excellence (Center No. 4/11) |
Optimal Lower and Upper Bounds for Representing Sequences JOURNAL ARTICLE published 23 June 2015 in ACM Transactions on Algorithms Research funded by Academy of Finland (250345 (Co-ECGR)) | Fondecyt (1-110066) |
Approximating Rooted Steiner Networks JOURNAL ARTICLE published 17 November 2014 in ACM Transactions on Algorithms Research funded by Natural Sciences and Engineering Research Council of Canada (No. OGP0138432 and No. 28833) |
Multiplierless multiple constant multiplication JOURNAL ARTICLE published May 2007 in ACM Transactions on Algorithms |
Race to idle JOURNAL ARTICLE published February 2014 in ACM Transactions on Algorithms |
A better approximation ratio for the vertex cover problem JOURNAL ARTICLE published October 2009 in ACM Transactions on Algorithms |
Uniform deterministic dictionaries JOURNAL ARTICLE published March 2008 in ACM Transactions on Algorithms |
Improved algorithms for orienteering and related problems JOURNAL ARTICLE published July 2012 in ACM Transactions on Algorithms Research funded by Division of Computing and Communication Foundations (CCF 0728782) |
A 4 k 2 kernel for feedback vertex set JOURNAL ARTICLE published March 2010 in ACM Transactions on Algorithms Research funded by Agence Nationale de la Recherche (ANR-06-BLAN-0148) |
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma JOURNAL ARTICLE published 31 January 2020 in ACM Transactions on Algorithms Research funded by SNSF (185030) |