Combinatorial Algorithms

• 

  Combinatorial Algorithms: 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers

  By Ljiljana Brankovic, Joe Ryan, William F. Smyth

  We note that appropriate Williamson type matrices may also be used to give propus-Hadamard matrices but do not pursue this avenue in this paper. There is also the possibility that this propus construction may lead to some insight into ...

• 

  Combinatorial Algorithms: Generation, Enumeration, and Search

  By Donald L. Kreher, Douglas R. Stinson

  Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most ...

• 

  Combinatorial Algorithms: Enlarged Second Edition

  By T. C. Hu, M. T. Shing

  Y. Perl, M. R. Garey, and S. Even, “Efficient Generation of Optimal Prefix Code: Search Trees”, Acta Informatica 1 (1972), pp. 307-310. 8. T. C. Hu and A. C. Tucker, “Optimal Computer-search Trees and VariableLength Alphabetic Codes”, ...

• 

  Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers

  By Thierry Lecroq, Laurent Mouchard

  ... functions, i.e., functions represented by a DNF where each variable occurs in only one polarity. Without loss of ... Combinatorial Algorithm for the Threshold Synthesis Problem 1 Introduction 2 Preliminaries 3 The Combinatorial Algorithm.

• 

  Combinatorial Algorithms: 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers

  By William F. Smyth, Costas S. Iliopoulos

  ... W.F. Smyth (Eds.): IWOCA 2011, LNCS 7056, pp. 121–134, 2011. c Springer-Verlag Berlin Heidelberg 2011 O(n) [8,12]. Generalizations ofthese results to the case of arbitrary Testing Monotone Read-Once Functions Introduction.

• 

  Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings

  By Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik

  ... the stable matching problem. Discrete Appl. Math. 11(3), 223–232 (1985) 6. Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algo- rithms. MIT Press, Boston (1989) 7. Irving, R.W.: Stable marriage and indifference ...

• 

  Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings

  By Paola Flocchini, Lucia Moura

  ... Mathematical Software - ICMS 2020, Lecture Notes in Computer Science, vol. 12097, pp. 162–172, Springer, Cham (2020). https://doi.org/10.1007/978-3-03052200-116 30. Topalova, S., Zhelezova, S.: Some parallelisms of PG(3,5) involving 556 ...

• 

  Combinatorial Algorithms: An Update

  By Herbert S. Wilf

  ... Lectures on Mathematical Combustion R. E. TARJAN , Data Structures and ... Ten Lectures on the Probabilistic Method PAUL C. FIFE , Dynamics of Internal ... Method of Equivalence and Its Applications Grace Wahba , Spline Models for ...