Facet browsing currently unavailable
Page 6 of 966 results
Sort by: relevance publication year
Determining plurality JOURNAL ARTICLE published June 2008 in ACM Transactions on Algorithms |
Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights JOURNAL ARTICLE published 31 July 2017 in ACM Transactions on Algorithms Research funded by NSF (1464239, 1218620 and 1540547) |
Optimizing throughput and energy in online deadline scheduling JOURNAL ARTICLE published December 2009 in ACM Transactions on Algorithms Research funded by University of Hong Kong (7176104) | Engineering and Physical Sciences Research Council (EP/E028276/1) |
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time JOURNAL ARTICLE published 31 October 2017 in ACM Transactions on Algorithms Research funded by Narodowe Centrum Nauki (N206 567140 and 2013/09/B/ST6/03136) | Suomen Akatemia (252083, 256287, and 283437) | Vetenskapsrådet (VR 2012-4730) |
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs JOURNAL ARTICLE published 17 June 2023 in ACM Transactions on Algorithms |
On the External Validity of Average-case Analyses of Graph Algorithms JOURNAL ARTICLE published 31 January 2024 in ACM Transactions on Algorithms |
Kernel(s) for problems with no kernel JOURNAL ARTICLE published September 2012 in ACM Transactions on Algorithms Research funded by Rigorous Theory of Preprocessing (267959) |
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) |
Scaling Algorithms for Weighted Matching in General Graphs JOURNAL ARTICLE published 31 January 2018 in ACM Transactions on Algorithms Research funded by National Science Foundation (1637546) |
A local algorithm for finding dense subgraphs JOURNAL ARTICLE published August 2010 in ACM Transactions on Algorithms |
On the set multicover problem in geometric settings JOURNAL ARTICLE published December 2012 in ACM Transactions on Algorithms Research funded by Division of Computing and Communication Foundations (CCF-0728782, CNS-0721899 and CCF-0915984) | Division of Computer and Network Systems (CCF-0728782, CNS-0721899 and CCF-0915984) |
Algorithms for distributional and adversarial pipelined filter ordering problems JOURNAL ARTICLE published March 2009 in ACM Transactions on Algorithms Research funded by Division of Information and Intelligent Systems (IIS-0546136ITR-0205647ITR-0205647) | National Science Foundation (IIS-0546136ITR-0205647ITR-0205647) |
Minimum cycle bases JOURNAL ARTICLE published December 2009 in ACM Transactions on Algorithms |
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting JOURNAL ARTICLE published 30 April 2017 in ACM Transactions on Algorithms Research funded by FWF (P26696) |
Nearest-Neighbor Searching Under Uncertainty II JOURNAL ARTICLE published 31 January 2017 in ACM Transactions on Algorithms Research funded by Advanced Cyberinfrastructure (ACI-1443046) | Research Grants Council, University Grants Committee (GRF-621413, GRF-16211614, GRF-16200415) | National Science Foundation (CCF-09-40671, CCF-10-12254, CCF-11-61359, CCF-08-30691, CCF-11-17336, CCF-12-18791, CCF-09-15984, CCF-12- 17462, CCF-1350888) | Division of Information and Intelligent Systems (IIS-14- 08846, IIS-1251019) | National Security Agency (H98230-10-1-0210) |
Competitive buffer management for shared-memory switches JOURNAL ARTICLE published November 2008 in ACM Transactions on Algorithms |
Parameterized Hardness of Art Gallery Problems JOURNAL ARTICLE published 31 October 2020 in ACM Transactions on Algorithms Research funded by supporteNetherlands Organisation for Scientific Research (016.Veni.192.250.) |
Finding equitable convex partitions of points in a polygon efficiently JOURNAL ARTICLE published August 2010 in ACM Transactions on Algorithms |
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Algorithms Research funded by Academy of Finland (274977) | Slovenian Research Agency (I0-0035, P1-0285, N1-0032, N1-0038, N1-0062, J1-6720, J1-7051) |
Scalable High-Quality Hypergraph Partitioning JOURNAL ARTICLE published 31 January 2024 in ACM Transactions on Algorithms |