{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T07:26:58Z","timestamp":1791012418031,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540462675","type":"print"},{"value":"9783540462682","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_2","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T08:07:42Z","timestamp":1159430862000},"page":"2-14","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms and Constraint Programming"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Grandoni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 856\u2013857 (1999)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jalgor.2004.06.008","volume":"54","author":"R. Beigel","year":"2005","unstructured":"Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289 n ). Journal of Algorithms\u00a054, 168\u2013204 (2005)","journal-title":"Journal of Algorithms"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C.: Arc-consistency and arc-consistency again. In: National Conference on Artificial Intelligence (AAAI), pp. 179\u2013190 (1994)","DOI":"10.1016\/0004-3702(94)90041-8"},{"key":"2_CR4","unstructured":"Bessi\u00e8re, C., Cordier, M.O.: Arc-consistency and arc-consistency again. In: National Conference on Artificial Intelligence (AAAI), pp. 108\u2013113 (1993)"},{"key":"2_CR5","unstructured":"Bessi\u00e8re, C., Freuder, E., Regin, J.C.: Using inference to reduce arc consistency computation. In: International Joint Conference on Artificial Intelligence, pp. 592\u2013598 (1995)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.tcs.2004.08.002","volume":"329","author":"T. Brueggemann","year":"2004","unstructured":"Brueggemann, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science\u00a0329, 303\u2013313 (2004)","journal-title":"Theoretical Computer Science"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J.M. Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters\u00a032, 547\u2013556 (2004)","journal-title":"Operations Research Letters"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E. Dantsin","year":"2002","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schning, U.: A deterministic (2\u2009\u2212\u20092\/(k\u2009+\u20091)) n algorithm for k-SAT based on local search. Theoretical Computer Science\u00a0289(1), 69\u201383 (2002)","journal-title":"Theoretical Computer Science"},{"key":"2_CR10","unstructured":"Debruyne, R.: A property of path inverse consistency leading to an optimal PIC algorithm. In: European Conference on Artificial Intelligence, pp. 88\u201392 (2000)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Debruyne, R., Bessi\u00e8re, C.: From restricted path consistency to max-restricted path consistency. In: Principles and Practice of Constraint Programming (CP), pp. 312\u2013326 (1997)","DOI":"10.1007\/BFb0017448"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1987","unstructured":"Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence\u00a034, 1\u201338 (1987)","journal-title":"Artificial Intelligence"},{"key":"2_CR13","volume-title":"Handbook of Data Structures and Applications","author":"C. Demetrescu","year":"2004","unstructured":"Demetrescu, C., Finocchi, I., Italiano, G.F.: Dynamic Graphs, ch. 22. In: Handbook of Data Structures and Applications, ch.\u00a022. CRC Press, Boca Raton (2004)"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1059513.1059514","volume":"52","author":"C. Demetrescu","year":"2005","unstructured":"Demetrescu, C., Italiano, G.F.: Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking Through the O(n 2) Barrier. Journal of the ACM\u00a052(2), 147\u2013156 (2005)","journal-title":"Journal of the ACM"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.F.: Dynamic Shortest Paths and Transitive Closure: Algorithmic Techniques and Data Structures. Journal of Discrete Algorithms\u00a04(3) (September 2006)","DOI":"10.1016\/j.jda.2005.12.003"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01, 195\u2013207 (1971\/72)","journal-title":"Networks"},{"key":"2_CR17","unstructured":"Elfe, C.D., Freuder, E.C.: Neighborhood inverse consistency preprocessing. In: National Conference on Artificial Intelligence (AAAI)\/Innovative Applications of Artificial Intelligence, vol.\u00a01, pp. 202\u2013208 (1996)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-45078-8_27","volume-title":"Algorithms and Data Structures","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: The traveling salesman problem for cubic graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 307\u2013318. Springer, Heidelberg (2003)"},{"key":"2_CR19","first-page":"459","volume":"7","author":"P. Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P.: On the number of complete subgraphs contained in certain graphs. Magyar Tudomanyos Akademia Matematikai Kutat\u00f3 Intezetenek K\u00f6zlemenyei\u00a07, 459\u2013464 (1962)","journal-title":"Magyar Tudomanyos Akademia Matematikai Kutat\u00f3 Intezetenek K\u00f6zlemenyei"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: domination - a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 191\u2013203. Springer, Heidelberg (2005)"},{"key":"2_CR21","first-page":"47","volume":"87","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the European Association for Theoretical Computer Science\u00a087, 47\u201377 (2005)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: A simple o(20.288 n ) independent set algorithm. In: Fomin, F., Grandoni, F., Kratsch, D. (eds.) ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 18\u201325 (2006)","DOI":"10.1145\/1109557.1109560"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-540-27836-8_49","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I.: Exact (Exponential) algorithms for treewidth and minimum fill-in. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 568\u2013580. Springer, Heidelberg (2004)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: ACM Symposium on the Theory of Computing (STOC), pp. 246\u2013251 (1983)","DOI":"10.1145\/800061.808753"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F. Glover","year":"1967","unstructured":"Glover, F.: Maximum matching in convex bipartite graph. Naval Research Logistic Quarterly\u00a014, 313\u2013316 (1967)","journal-title":"Naval Research Logistic Quarterly"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Italiano, G.F.: Improved algorithms for max-restricted path consistency. In: Principles and Practice of Constraint Programming (CP), pp. 858\u2013862 (2003)","DOI":"10.1007\/978-3-540-45193-8_67"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-30559-0_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Grandoni","year":"2004","unstructured":"Grandoni, F., Italiano, G.F.: Decremental clique problem. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 142\u2013153. Springer, Heidelberg (2004)"},{"key":"2_CR28","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of SIAM\u00a010, 196\u2013210 (1962)","journal-title":"Journal of SIAM"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/jcom.1998.0476","volume":"14","author":"X. Huang","year":"1998","unstructured":"Huang, X., Pan, V.: Fast rectangular matrix multiplication and applications. Journal of Complexity\u00a014(2), 257\u2013299 (1998)","journal-title":"Journal of Complexity"},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR32","first-page":"61","volume":"82","author":"K. Iwama","year":"2004","unstructured":"Iwama, K.: Worst-case upper bounds for k-SAT. Bulletin of the European Association for Theoretical Computer Science\u00a082, 61\u201371 (2004)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-45349-0_23","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., Thiel, S.: Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 306\u2013319. Springer, Heidelberg (2000)"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"Mohr, R., Henderson, T.C.: Arc and path consistency revised. Artificial Intelligence\u00a028, 225\u2013233 (1986)","journal-title":"Artificial Intelligence"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/11672142_46","volume-title":"STACS 2006","author":"D. M\u00f6lle","year":"2006","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: A faster algorithm for the Steiner tree problem. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 561\u2013570. Springer, Heidelberg (2006)"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"key":"2_CR38","unstructured":"Puget, J.-F.: A fast algorithm for the bound consistency of alldiff constraints. In: National Conference on Artificial Intelligence (AAAI)\/Innovative Applications of Artificial Intelligence, pp. 359\u2013366 (1998)"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11785293_17","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"I. Razgon","year":"2006","unstructured":"Razgon, I.: Exact computation of maximum induced forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"key":"2_CR40","unstructured":"Regin, J.C.: A filtering algorithm for constraints of difference in CSP. In: National Conference on Artificial Intelligence (AAAI), vol.\u00a01, pp. 362\u2013367 (1994)"},{"issue":"3","key":"2_CR41","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J.M. Robson","year":"1986","unstructured":"Robson, J.M.: Algorithms for maximum independent sets. Journal of Algorithms\u00a07(3), 425\u2013440 (1986)","journal-title":"Journal of Algorithms"},{"key":"2_CR42","unstructured":"Saraswat, V.A.: Concurrent Logic Programming Languages. Ph.D thesis, Carnegie-Mellon University (1987)"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-31856-9_3","volume-title":"STACS 2005","author":"U. Sch\u00f6ning","year":"2005","unstructured":"Sch\u00f6ning, U.: Algorithmics in exponential time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 36\u201343. Springer, Heidelberg (2005)"},{"key":"2_CR44","unstructured":"Stergiou, K.: Representation and Reasoning with Non-Binary Constraints. Ph.D thesis, University of Strathclyde, Glasgow, Scotland (2001)"},{"key":"2_CR45","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck Van","year":"1989","unstructured":"Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge (1989)"},{"key":"2_CR46","volume-title":"The OPL Optimization Programming Language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P.: The OPL Optimization Programming Language. The MIT Press, Cambridge (1999)"},{"key":"2_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/978-3-540-27836-8_101","volume-title":"Automata, Languages and Programming","author":"R. Williams","year":"2004","unstructured":"Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1227\u20131237. Springer, Heidelberg (2004)"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for np-hard problems: A survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"},{"key":"2_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-28639-4_25","volume-title":"Parameterized and Exact Computation","author":"G.J. Woeginger","year":"2004","unstructured":"Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 281\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:51:25Z","timestamp":1605624685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/11889205_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}