Algebraic fingerprints for faster algorithms

Algorithmic solutions to tough computational problems are making an impressive comeback.

[1]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[2]  Ryan Williams,et al.  LIMITS and Applications of Group Algebras for Parameterized Problems , 2009, ACM Trans. Algorithms.

[3]  P. Rowlinson.  ALGEBRAIC GRAPH THEORY (Graduate Texts in Mathematics 207) By CHRIS GODSIL and GORDON ROYLE: 439 pp., £30.50, ISBN 0-387-95220-9 (Springer, New York, 2001). , 2002 .

[4]  Andreas Björklund,et al.  Shortest cycle through specified elements , 2012, SODA.

[5]  Sylvain Guillemot,et al.  Finding and Counting Vertex-Colored Subtrees , 2010, Algorithmica.

[6]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[7]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[8]  Fahad Panolan,et al.  Representative Sets of Product Families , 2014, ESA.

[9]  Andreas Björklund,et al.  Determinant Sums for Undirected Hamiltonicity , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[10]  Ioannis Koutis.  Constrained multilinear detection for faster functional motif discovery , 2012, Inf. Process. Lett..

[11]  Lance Fortnow,et al.  The status of the P versus NP problem , 2009, CACM.

[12]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[13]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[14]  Sylvain Guillemot,et al.  Finding and Counting Vertex-Colored Subtrees , 2010, MFCS.

[15]  Fedor V. Fomin,et al.  Faster algorithms for finding and counting subgraphs , 2009, J. Comput. Syst. Sci..

[16]  Paola Bonizzoni,et al.  On the parameterized complexity of the repetition free longest common subsequence problem , 2012, Inf. Process. Lett..

[17]  Andreas Björklund,et al.  Probably Optimal Graph Motifs , 2013, STACS.

[18]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[19]  Michael R. Fellows,et al.  Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.

[20]  Andreas Björklund,et al.  Narrow sieves for parameterized paths and packings , 2010, J. Comput. Syst. Sci..

[21]  Michal Pilipczuk,et al.  Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[22]  Andreas Björklund,et al.  Exact Covers via Determinants , 2010, STACS.

[23]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[24]  Joshua R. Wang,et al.  Finding Four-Node Subgraphs in Triangle Time , 2015, SODA.

[25]  Ioannis Koutis.  A faster parameterized algorithm for set packing , 2005, Inf. Process. Lett..

[26]  Roded Sharan,et al.  Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks , 2006, J. Comput. Biol..

[27]  Noga Alon,et al.  Color-coding , 1995, JACM.

[28]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[29]  Ioannis Koutis,et al.  Faster Algebraic Algorithms for Path and Packing Problems , 2008, ICALP.

[30]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[31]  Ryan Williams,et al.  Finding paths of length k in O*(2k) time , 2008, Inf. Process. Lett..

[32]  Noga Alon,et al.  Biomolecular network motif counting and discovery by color coding , 2008, ISMB.

[33]  B. Monien.  How to Find Long Paths Efficiently , 1985 .

[34]  Jianer Chen,et al.  Improved algorithms for path, matching, and packing problems , 2007, SODA '07.