• Xu Z, Liu C, Li C, Mao R, Yang J, Kämpfe T, Imani M, Li C, Zhuo C and Yin X. (2024). FeReX: A Reconfigurable Design of Multi-Bit Ferroelectric Compute-in-Memory for Nearest Neighbor Search 2024 Design, Automation & Test in Europe Conference & Exhibition (DATE). 10.23919/DATE58400.2024.10546615. 978-3-9819263-8-5. (1-6).

    https://ieeexplore.ieee.org/document/10546615/

  • G S S, Joshi P, Barui A and Panigrahi P. (2024). A Quantum Approach to Solve N-Queens Problem 2024 16th International Conference on COMmunication Systems & NETworkS (COMSNETS). 10.1109/COMSNETS59351.2024.10427458. 979-8-3503-8311-9. (1046-1051).

    https://ieeexplore.ieee.org/document/10427458/

  • Jung J, Yu Y and Lee S. Reinforcement Learning-Based Delay Line Design for Crosstalk Minimization. IEEE Access. 10.1109/ACCESS.2024.3488717. 12. (161557-161568).

    https://ieeexplore.ieee.org/document/10740167/

  • Valdivia Alcalá D, García Vico Á and Carmona del Jesús C. (2024). Optimization of Transport Routes Through a Social Interaction Algorithm-Based Application. International Joint Conferences. 10.1007/978-3-031-75016-8_28. (301-311).

    https://link.springer.com/10.1007/978-3-031-75016-8_28

  • Filimon D, Roșca E and Ruscă F. (2023). Optimization of Fuel Consumption for an Offshore Supply Tug Using a Backtracking Algorithm. Sustainability. 10.3390/su152215787. 15:22. (15787).

    https://www.mdpi.com/2071-1050/15/22/15787

  • Turan M and Pekyürek E. (2022). Creating complex mazes quickly. Journal of Computational Methods in Sciences and Engineering. 22:3. (801-810). Online publication date: 1-Jan-2022.

    https://doi.org/10.3233/JCM-225918

  • Hefner F, Schmidbauer S and Franke J. (2022). Optimizing the wiring sequence based on a Constraint Satisfaction Problem for robot-based manufacturing of solderless wrapped connections. Procedia CIRP. 10.1016/j.procir.2022.09.073. 112. (203-208).

    https://linkinghub.elsevier.com/retrieve/pii/S2212827122012367

  • Khalfaoui K, Boudjedaa T and Kerkouche E. (2021). Automatic design of quantum circuits. Quantum Information Processing. 20:9. Online publication date: 1-Sep-2021.

    https://doi.org/10.1007/s11128-021-03208-8

  • Valiente G. (2021). Algorithmic Techniques. Algorithms on Trees and Graphs. 10.1007/978-3-030-81885-2_2. (45-83).

    https://link.springer.com/10.1007/978-3-030-81885-2_2

  • Chowdhary K. (2020). Constraint Satisfaction Problems. Fundamentals of Artificial Intelligence. 10.1007/978-81-322-3972-7_10. (273-302).

    http://link.springer.com/10.1007/978-81-322-3972-7_10

  • Howell I, Choueiry B and Yu H. (2020). Visualizations to Summarize Search Behavior. Principles and Practice of Constraint Programming. 10.1007/978-3-030-58475-7_23. (392-409).

    http://link.springer.com/10.1007/978-3-030-58475-7_23

  • Laverty B and Murphy T. (2018). Optimal Rectangle Packing for the 70 Square. Recreational Mathematics Magazine. 10.2478/rmm-2018-0001. 5:9. (5-47). Online publication date: 1-Sep-2018.. Online publication date: 1-Sep-2018.

    https://www.sciendo.com/article/10.2478/rmm-2018-0001

  • Gent I, Jefferson C and Nightingale P. Complexity of n-queens completion (extended abstract). Proceedings of the 27th International Joint Conference on Artificial Intelligence. (5608-5611).

    /doi/10.5555/3304652.3304809

  • Woodward R, Choueiry B and Bessiere C. A reactive strategy for high-level consistency during search. Proceedings of the 27th International Joint Conference on Artificial Intelligence. (1390-1397).

    /doi/10.5555/3304415.3304612

  • Radiano O, Graber Y, Mahler M, Sigal L and Shamir A. (2017). Story Albums: Creating Fictional Stories From Personal Photograph Sets. Computer Graphics Forum. 10.1111/cgf.13099. 37:1. (19-31). Online publication date: 1-Feb-2018.

    https://onlinelibrary.wiley.com/doi/10.1111/cgf.13099

  • Gent I, Jefferson C and Nightingale P. (2017). Complexity of n-queens completion. Journal of Artificial Intelligence Research. 59:1. (815-848). Online publication date: 1-May-2017.

    /doi/10.5555/3176788.3176807

  • Tay N, Botzheim J and Kubota N. (2016). Weighted Constraint Satisfaction for Smart Home Automation and Optimization. Advances in Artificial Intelligence. 2016. (1). Online publication date: 1-Nov-2016.

    https://doi.org/10.1155/2016/2959508

  • Graoui E, Zrira N, Mekouar S, Benelallam I and Bouyakhf E. (2016). Outlier and anomalous behavior detection in social networks using constraint programming 2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA). 10.1109/AICCSA.2016.7945699. 978-1-5090-4320-0. (1-8).

    http://ieeexplore.ieee.org/document/7945699/

  • Ortiz-Bayliss J, Terashima-Marín H and Conant-Pablos S. (2016). Combine and conquer. Artificial Intelligence Review. 46:3. (327-349). Online publication date: 1-Oct-2016.

    https://doi.org/10.1007/s10462-016-9466-x

  • Atahary T, Taha T and Douglass S. (2016). Parallelized mining of domain knowledge on GPGPU and Xeon Phi clusters. The Journal of Supercomputing. 72:6. (2132-2156). Online publication date: 1-Jun-2016.

    https://doi.org/10.1007/s11227-016-1712-0

  • Moreno-Scott J, Ortiz-Bayliss J, Terashima-Marín H and Conant-Pablos S. (2016). Experimental matching of instances to heuristics for constraint satisfaction problems. Computational Intelligence and Neuroscience. 2016. (37-37). Online publication date: 1-Jan-2016.

    https://doi.org/10.1155/2016/7349070

  • Li J, Zou L, Tian F, Dong X, Zou Z and Yang H. (2016). Parameter Identification of Lithium-Ion Batteries Model to Predict Discharge Behaviors Using Heuristic Algorithm. Journal of The Electrochemical Society. 10.1149/2.0861608jes. 163:8. (A1646-A1652).

    http://jes.ecsdl.org/lookup/doi/10.1149/2.0861608jes

  • Dayyani I, Shaw A, Saavedra Flores E and Friswell M. (2015). The mechanics of composite corrugated structures: A review with applications in morphing aircraft. Composite Structures. 10.1016/j.compstruct.2015.07.099. 133. (358-380). Online publication date: 1-Dec-2015.

    https://linkinghub.elsevier.com/retrieve/pii/S0263822315006455

  • Wang Z, Huang D, Tan J, Liu T, Zhao K and Li L. (2015). A parallel algorithm for solving the n-queens problem based on inspired computational model. Biosystems. 10.1016/j.biosystems.2015.03.004. 131. (22-29). Online publication date: 1-May-2015.

    https://linkinghub.elsevier.com/retrieve/pii/S0303264715000374

  • Benhala B, Kotti M, Ahaitouf A and Fakhfakh M. Backtracking ACO for RF-Circuit Design Optimization. Performance Optimization Techniques in Analog, Mixed-Signal, and Radio-Frequency Circuit Design. 10.4018/978-1-4666-6627-6.ch007. (158-179).

    http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-4666-6627-6.ch007

  • Ortiz-Bayliss J, Terashima-Marín H and Conant-Pablos S. (2015). Lifelong Learning Selection Hyper-heuristics for Constraint Satisfaction Problems. Advances in Artificial Intelligence and Soft Computing. 10.1007/978-3-319-27060-9_15. (190-201).

    http://link.springer.com/10.1007/978-3-319-27060-9_15

  • Rakhya S and Singh S. (2014). Rakhya's method: A case based approach to solve n-queens problem 2014 18th International Conference on System Theory, Control and Computing (ICSTCC). 10.1109/ICSTCC.2014.6982509. 978-1-4799-4601-3. (755-762).

    http://ieeexplore.ieee.org/document/6982509/

  • Rakhya S and Singh S. (2014). Rakhya's method: A case based approach to solve n-queens problem 2014 11th International Conference on Electronics, Computer and Computation (ICECCO). 10.1109/ICECCO.2014.6997584. 978-1-4799-4106-3. (1-8).

    http://ieeexplore.ieee.org/document/6997584/

  • Yao H, Gao Q, Cai Y, Zhou Q and Sham C. (2014). Length matching in detailed routing for analog and mixed signal circuits. Microelectronics Journal. 10.1016/j.mejo.2014.04.007. 45:6. (604-612). Online publication date: 1-Jun-2014.

    https://linkinghub.elsevier.com/retrieve/pii/S0026269214000974

  • Menouer T and Le Cun B. Deterministic partitioning strategy to parallelize the constraint programming search space. Proceedings of the High Performance Computing Symposium. (1-8).

    /doi/10.5555/2663510.2663531

  • Laalaoui Y and Bouguila N. (2014). Review. Expert Systems with Applications: An International Journal. 41:5. (2196-2210). Online publication date: 1-Apr-2014.

    https://doi.org/10.1016/j.eswa.2013.09.018

  • Ortiz-Bayliss J, Terashima-Marín H and Conant-Pablos S. (2014). Branching Schemes and Variable Ordering Heuristics for Constraint Satisfaction Problems: Is There Something to Learn?. Nature Inspired Cooperative Strategies for Optimization (NICSO 2013). 10.1007/978-3-319-01692-4_25. (329-342).

    http://link.springer.com/10.1007/978-3-319-01692-4_25

  • Atahary T, Douglass S and Taha T. (2014). Hardware Accelerated Mining of Domain Knowledge. Network Science and Cybersecurity. 10.1007/978-1-4614-7597-2_16. (251-271).

    https://link.springer.com/10.1007/978-1-4614-7597-2_16

  • Ortiz-Bayliss J, Ozcan E, Parkes A and Terashima-Marin H. (2013). A genetic programming hyper-heuristic: Turning features into heuristics for constraint satisfaction 2013 13th UK Workshop on Computational Intelligence (UKCI). 10.1109/UKCI.2013.6651304. 978-1-4799-1568-2. (183-190).

    http://ieeexplore.ieee.org/document/6651304/

  • Atahary T, Taha T and Douglass S. Hardware Accelerated Cognitively Enhanced Complex Event Processing Architecture. Proceedings of the 2013 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing. (283-288).

    https://doi.org/10.1109/SNPD.2013.57

  • Maazallahi R, Niknafs A and Arabkhedri P. (2013). A Polynomial-Time DNA Computing Solution for the N-Queens Problem. Procedia - Social and Behavioral Sciences. 10.1016/j.sbspro.2013.06.118. 83. (622-628). Online publication date: 1-Jul-2013.

    https://linkinghub.elsevier.com/retrieve/pii/S1877042813011853

  • (2013). Bibliography. Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. 10.1002/9781118753620.biblio. (147-156). Online publication date: 17-Jun-2013.

    https://onlinelibrary.wiley.com/doi/10.1002/9781118753620.biblio

  • Ortiz-Bayliss J, Terashima-Marin H, Ozcan E, Parkes A and Conant-Pablos S. (2013). Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space 2013 IEEE Congress on Evolutionary Computation (CEC). 10.1109/CEC.2013.6557975. 978-1-4799-0454-9. (3307-3314).

    http://ieeexplore.ieee.org/document/6557975/

  • Ortiz-Bayliss J, Terashima-Marin H and Conant-Pablos S. (2013). Using learning classifier systems to design selective hyper-heuristics for constraint satisfaction problems 2013 IEEE Congress on Evolutionary Computation (CEC). 10.1109/CEC.2013.6557885. 978-1-4799-0454-9. (2618-2625).

    http://ieeexplore.ieee.org/document/6557885/

  • Sosa-Ascencio A, Terashima-Marin H and Valenzuela-Rendon M. (2013). Grammar-based Genetic Programming for evolving variable ordering heuristics 2013 IEEE Congress on Evolutionary Computation (CEC). 10.1109/CEC.2013.6557696. 978-1-4799-0454-9. (1154-1161).

    http://ieeexplore.ieee.org/document/6557696/

  • Bulnes F, Usamentiaga R, Garcia D, Molleda J and Rendueles J. Periodic defects in steel strips: Detection through a vision-based technique. IEEE Industry Applications Magazine. 10.1109/MIAS.2012.2215638. 19:2. (39-46).

    http://ieeexplore.ieee.org/document/6399523/

  • H'Mida F and Lopez P. (2013). Multi-site scheduling under production and transportation constraints. International Journal of Computer Integrated Manufacturing. 26:3. (252-266). Online publication date: 1-Mar-2013.

    https://doi.org/10.1080/0951192X.2012.688141

  • Ortiz-Bayliss J, Terashima-MaríN H and Conant-Pablos S. (2013). Learning vector quantization for variable ordering in constraint satisfaction problems. Pattern Recognition Letters. 34:4. (423-432). Online publication date: 1-Mar-2013.

    https://doi.org/10.1016/j.patrec.2012.09.009

  • Ortiz-Bayliss J, Terashima-Marín H and Conant-Pablos S. (2013). A Supervised Learning Approach to Construct Hyper-heuristics for Constraint Satisfaction. Pattern Recognition. 10.1007/978-3-642-38989-4_29. (284-293).

    http://link.springer.com/10.1007/978-3-642-38989-4_29

  • Kilpeläinen P. (2012). Using XQuery for problem solving. Software—Practice & Experience. 42:12. (1433-1465). Online publication date: 1-Dec-2012.

    https://doi.org/10.1002/spe.1140

  • Ortiz-Bayliss J, Terashima-Marín H, Conant-Pablos S, Özcan E and Parkes A. Improving the performance of vector hyper-heuristics through local search. Proceedings of the 14th annual conference on Genetic and evolutionary computation. (1269-1276).

    https://doi.org/10.1145/2330163.2330339

  • Ennis J, Fayle C and Ennis D. (2012). Assignment-minimum clique coverings. ACM Journal of Experimental Algorithmics. 17. (1.1-1.17). Online publication date: 1-Jul-2012.

    https://doi.org/10.1145/2133803.2275596

  • Meseguer P. (2012). Towards 40 years of constraint reasoning. Progress in Artificial Intelligence. 10.1007/s13748-011-0006-2. 1:1. (25-43). Online publication date: 1-Apr-2012.

    http://link.springer.com/10.1007/s13748-011-0006-2

  • Yao H, Cai Y and Gao Q. (2012). LEMAR: A novel length matching routing algorithm for analog and mixed signal circuits 2012 17th Asia and South Pacific Design Automation Conference (ASP-DAC). 10.1109/ASPDAC.2012.6164937. 978-1-4673-0772-7. (157-162).

    http://ieeexplore.ieee.org/document/6164937/

  • San Segundo P. (2011). New decision rules for exact search in N-Queens. Journal of Global Optimization. 51:3. (497-514). Online publication date: 1-Nov-2011.

    https://doi.org/10.1007/s10898-011-9653-x

  • Bulnes F, Usamentiaga R, Garcia D, Molleda J and Rendueles J. (2011). Vision-based technique for periodical defect detection in hot steel strips 2011 IEEE Industry Applications Society Annual Meeting. 10.1109/IAS.2011.6074384. 978-1-4244-9498-9. (1-8).

    http://ieeexplore.ieee.org/document/6074384/

  • Wang X and Zhu D. Efficient solutions for a problem in currency systems. Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I. (171-178).

    /doi/10.5555/2045625.2045649

  • Trojet M, H'Mida F and Lopez P. (2011). Project scheduling under resource constraints. Computers and Industrial Engineering. 61:2. (357-363). Online publication date: 1-Sep-2011.

    https://doi.org/10.1016/j.cie.2010.08.014

  • Ortiz-Bayliss J, Terashima-Marín H and Conant-Pablos S. Neural networks to guide the selection of heuristics within constraint satisfaction problems. Proceedings of the Third Mexican conference on Pattern recognition. (250-259).

    /doi/10.5555/2026143.2026175

  • Gilpin A and Sandholm T. (2011). Information-theoretic approaches to branching in search. Discrete Optimization. 8:2. (147-159). Online publication date: 1-May-2011.

    https://doi.org/10.1016/j.disopt.2010.07.001

  • Wang X and Zhu D. (2011). Efficient Solutions for a Problem in Currency Systems. Artificial Intelligence and Computational Intelligence. 10.1007/978-3-642-23881-9_22. (171-178).

    http://link.springer.com/10.1007/978-3-642-23881-9_22

  • Wang X and Zhu D. (2011). Generation and Enumeration of Implication Sets. Advances in Information Technology and Education. 10.1007/978-3-642-22418-8_12. (87-92).

    http://link.springer.com/10.1007/978-3-642-22418-8_12

  • Ortiz-Bayliss J, Terashima-Marín H and Conant-Pablos S. (2011). Neural Networks to Guide the Selection of Heuristics within Constraint Satisfaction Problems. Pattern Recognition. 10.1007/978-3-642-21587-2_27. (250-259).

    http://link.springer.com/10.1007/978-3-642-21587-2_27

  • Lecoutre C. (2011). Backtrack Search Techniques And Heuristics. Wiley Encyclopedia of Operations Research and Management Science. 10.1002/9780470400531.eorms1011. Online publication date: 1-Jan-2011.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470400531.eorms1011

  • Barták R. (2011). History of Constraint Programming. Wiley Encyclopedia of Operations Research and Management Science. 10.1002/9780470400531.eorms0382. Online publication date: 1-Jan-2011.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470400531.eorms0382

  • Barták R, Salido M and Rossi F. (2010). Review:. The Knowledge Engineering Review. 25:3. (249-279). Online publication date: 1-Sep-2010.

    https://doi.org/10.1017/S0269888910000202

  • Korf R, Moffitt M and Pollack M. (2008). Optimal rectangle packing. Annals of Operations Research. 10.1007/s10479-008-0463-6. 179:1. (261-295). Online publication date: 1-Sep-2010.

    http://link.springer.com/10.1007/s10479-008-0463-6

  • Barták R, Salido M and Rossi F. (2008). Constraint satisfaction techniques in planning and scheduling. Journal of Intelligent Manufacturing. 10.1007/s10845-008-0203-4. 21:1. (5-15). Online publication date: 1-Feb-2010.

    http://link.springer.com/10.1007/s10845-008-0203-4

  • Pimentel B. Recursion in Hardware. Proceedings of the 2009 Second International Conference on Advances in Circuits, Electronics and Micro-electronics. (94-100).

    https://doi.org/10.1109/CENICS.2009.23

  • Petcu A. A Class of Algorithms for Distributed Constraint Optimization. Proceedings of the 2009 conference on A Class of Algorithms for Distributed Constraint Optimization. (1-277).

    /doi/10.5555/1564098.1564100

  • Trojet M, H'Mida F and Lopez P. (2009). Project scheduling under resource constraints: Application of the cumulative global constraint Industrial Engineering (CIE39). 10.1109/ICCIE.2009.5223894. 978-1-4244-4135-8. (62-67).

    http://ieeexplore.ieee.org/document/5223894/

  • Mayer M. (2009). Web History Tools and Revisitation Support. Foundations and Trends in Human-Computer Interaction. 2:3. (173-278). Online publication date: 1-Mar-2009.

    https://doi.org/10.1561/1100000011

  • H’Mida F and Vernadat F. (2008). A constraint approach (flexible CSP) for alternative cost estimation of a mechanical product. International Journal of Production Research. 10.1080/00207540802425872. 47:2. (305-320). Online publication date: 15-Jan-2009.

    https://www.tandfonline.com/doi/full/10.1080/00207540802425872

  • Bacchus F, Dalmao S and Pitassi T. (2009). Solving #SAT and Bayesian inference with backtracking search. Journal of Artificial Intelligence Research. 34:1. (391-442). Online publication date: 1-Jan-2009.

    /doi/10.5555/1622716.1622727

  • Verfaillie G and Schiex T. (2009). Constraint Satisfaction Problems. Decision‐making Process. 10.1002/9780470611876.ch6. (265-320). Online publication date: 1-Jan-2009.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470611876.ch6

  • (2009). Bibliography. Constraint Networks. 10.1002/9780470611821.biblio. (547-570). Online publication date: 1-Jan-2009.

    https://onlinelibrary.wiley.com/doi/10.1002/9780470611821.biblio

  • Salido M, Garrido A and Barták R. (2008). Introduction. Engineering Applications of Artificial Intelligence. 21:5. (679-682). Online publication date: 1-Aug-2008.

    https://doi.org/10.1016/j.engappai.2008.03.007

  • Yaner P and Goel A. (2008). Analogical recognition of shape and structure in design drawings. Artificial Intelligence for Engineering Design, Analysis and Manufacturing. 22:2. (117-128). Online publication date: 1-Apr-2008.

    https://doi.org/10.1017/S0890060408000085

  • Salido M. (2008). A non-binary constraint ordering heuristic for constraint satisfaction problems. Applied Mathematics and Computation. 10.1016/j.amc.2007.08.064. 198:1. (280-295). Online publication date: 1-Apr-2008.

    http://linkinghub.elsevier.com/retrieve/pii/S0096300307008880

  • Hadjieleftheriou M, Mamoulis N and Tao Y. Continuous constraint query evaluation for spatiotemporal streams. Proceedings of the 10th international conference on Advances in spatial and temporal databases. (348-365).

    /doi/10.5555/1784462.1784482

  • Tyugu E. Algorithms and Architectures of Artificial Intelligence. Proceedings of the 2007 conference on Algorithms and Architectures of Artificial Intelligence. (1-171).

    /doi/10.5555/1565475.1565477

  • Demaine E and Demaine M. (2007). Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity. Graphs and Combinatorics. 23:1. (195-208). Online publication date: 1-Feb-2007.

    https://doi.org/10.1007/s00373-007-0713-4

  • Gilpin A and Sandholm T. Information-theoretic approaches to branching in search. Proceedings of the 20th international joint conference on Artifical intelligence. (2286-2292).

    /doi/10.5555/1625275.1625644

  • Hadjieleftheriou M, Mamoulis N and Tao Y. Continuous Constraint Query Evaluation for Spatiotemporal Streams. Advances in Spatial and Temporal Databases. 10.1007/978-3-540-73540-3_20. (348-365).

    http://link.springer.com/10.1007/978-3-540-73540-3_20

  • Frank S, Hofstedt P, Pepper P and Reckmann D. Solution Strategies for Multi-domain Constraint Logic Programs. Perspectives of Systems Informatics. 10.1007/978-3-540-70881-0_19. (209-222).

    http://link.springer.com/10.1007/978-3-540-70881-0_19

  • Frank S, Hofstedt P, Pepper P and Reckmann D. Solution strategies for multi-domain constraint logic programs. Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics. (209-222).

    /doi/10.5555/1760700.1760721

  • Hou S and Jacobsen H. Predicate-based Filtering of XPath Expressions. Proceedings of the 22nd International Conference on Data Engineering.

    https://doi.org/10.1109/ICDE.2006.115

  • Freuder E and Mackworth A. (2006). Constraint Satisfaction: An Emerging Paradigm. Handbook of Constraint Programming. 10.1016/S1574-6526(06)80006-4. (13-27).

    https://linkinghub.elsevier.com/retrieve/pii/S1574652606800064

  • Clancy D and Kuipers B. (2005). Time in Qualitative Simulation. . 10.1016/S1574-6526(05)80022-7. (655-664).

    https://linkinghub.elsevier.com/retrieve/pii/S1574652605800227

  • Salido M and Barber F. A Non-Binary Constraint Ordering Approach to Scheduling Problems. Applications and Innovations in Intelligent Systems XII. 10.1007/1-84628-103-2_6. (81-94).

    http://link.springer.com/10.1007/1-84628-103-2_6

  • Chmeiss A and Sais L. Constraint Satisfaction Problems. Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence. (252-257).

    https://doi.org/10.1109/ICTAI.2004.43

  • Bozinovski A and Bozinovski S. N-queens pattern generation. Proceedings of the 2004 international symposium on Information and communication technologies. (281-286).

    /doi/10.5555/1071509.1071564

  • Korf R. Optimal rectangle packing. Proceedings of the Fourteenth International Conference on International Conference on Automated Planning and Scheduling. (142-149).

    /doi/10.5555/3037008.3037027

  • Lesh N, Marks J, McMahon A and Mitzenmacher M. (2004). Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters. 90:1. (7-14). Online publication date: 15-Apr-2004.

    https://doi.org/10.1016/j.ipl.2004.01.006

  • Salido M and Barber F. (2004). Distributed Non-binary Constraints. Current Topics in Artificial Intelligence. 10.1007/978-3-540-25945-9_27. (271-280).

    http://link.springer.com/10.1007/978-3-540-25945-9_27

  • Irgens M and Havens W. (2004). On Selection Strategies for the DPLL Algorithm. Advances in Artificial Intelligence. 10.1007/978-3-540-24840-8_20. (277-291).

    http://link.springer.com/10.1007/978-3-540-24840-8_20

  • Salido M and Barber F. (2004). How to Classify Hard and Soft Constraints in Non-binary Constraint Satisfaction Problems. Research and Development in Intelligent Systems XX. 10.1007/978-0-85729-412-8_16. (213-226).

    http://link.springer.com/10.1007/978-0-85729-412-8_16

  • Younes H and Simmons R. (2003). VHPOP. Journal of Artificial Intelligence Research. 20:1. (405-430). Online publication date: 1-Dec-2003.

    /doi/10.5555/1622452.1622466

  • Zhang Z, Fan Y, Potkonjak M and Cong J. Gradual Relaxation Techniques with Applications to Behavioral Synthesis. Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design.

    /doi/10.5555/996070.1009941

  • Golden K and Pang W. Constraint reasoning over strings. Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming. (377-391).

    https://doi.org/10.1007/978-3-540-45193-8_26

  • Dotú I, del Val A and Cebrián M. Redundant modeling for The QuasiGroup Completion Problem. Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming. (288-302).

    https://doi.org/10.1007/978-3-540-45193-8_20

  • Zhiru Zhang , Yiping Fan , Potkonjak M and Cong J. (2003). Gradual relaxation techniques with applications to behavioral synthesis ICCAD-2003. International Conference on Computer Aided Design. 10.1109/ICCAD.2003.159735. 1-58113-762-1. (529-535).

    http://ieeexplore.ieee.org/document/1257862/

  • (2003). Bibliography. Constraint Processing. 10.1016/B978-155860890-0/50017-7. (441-458).

    https://linkinghub.elsevier.com/retrieve/pii/B9781558608900500177

  • Frank S, Hofstedt P and Mai P. (2003). A Flexible Meta-solver Framework for Constraint Solver Collaboration. KI 2003: Advances in Artificial Intelligence. 10.1007/978-3-540-39451-8_38. (520-534).

    http://link.springer.com/10.1007/978-3-540-39451-8_38

  • Younes H and Simmons R. Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling. Proceedings of the 14th International Conference on Computer Aided Verification. (223-235).

    /doi/10.5555/647771.760735

  • Letavec C and Ruggiero J. (2002). The n-Queens Problem. INFORMS Transactions on Education. 2:3. (101-103). Online publication date: 1-May-2002.

    /doi/10.5555/2877190.2877197

  • Dechter R and Frost D. (2002). Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence. 136:2. (147-188). Online publication date: 18-Apr-2002.

    https://doi.org/10.1016/S0004-3702(02)00120-0

  • Chiu C, Chou C, Lee J, Leung H and Leung Y. (2002). A Constraint-Based Interactive Train Rescheduling Tool. Constraints. 7:2. (167-198). Online publication date: 1-Apr-2002.

    https://doi.org/10.1023/A:1015109732002

  • Liu J, Jing H and Tang Y. (2002). Multi-agent oriented constraint satisfaction. Artificial Intelligence. 136:1. (101-144). Online publication date: 15-Feb-2002.

    https://doi.org/10.1016/S0004-3702(01)00174-6

  • Zheng L and Stuckey P. (2002). Improving SAT using 2SAT. Australian Computer Science Communications. 24:1. (331-340). Online publication date: 1-Jan-2002.

    /doi/10.5555/563857.563839

  • Zheng L and Stuckey P. Improving SAT using 2SAT. Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4. (331-340).

    /doi/10.5555/563801.563839

  • Jaziri W, Paquet T, Alimi A and Delahaye D. Multi-level optimization strategy for the prevention of run-off risks SMC2002: IEEE International Conference on Systems, Man and Cybernetics. 10.1109/ICSMC.2002.1168019. 0-7803-7437-1. (466-471).

    http://ieeexplore.ieee.org/document/1168019/

  • Younes H and Simmons R. (2002). Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling. Computer Aided Verification. 10.1007/3-540-45657-0_17. (223-235).

    http://link.springer.com/10.1007/3-540-45657-0_17

  • Carballo J and Director S. Application of constraint-based heuristics in collaborative design. Proceedings of the 38th annual Design Automation Conference. (395-400).

    https://doi.org/10.1145/378239.378533

  • Miguel I and Shen Q. (2001). Solution Techniques for Constraint Satisfaction Problems. Artificial Intelligence Review. 15:4. (269-293). Online publication date: 1-Jun-2001.

    https://doi.org/10.1023/A:1011096320004

  • Miguel I and Shen Q. (2001). Solution Techniques for Constraint Satisfaction Problems. Artificial Intelligence Review. 15:4. (243-267). Online publication date: 1-Jun-2001.

    https://doi.org/10.1023/A:1011039901653

  • Bharitkar S and Mendel J. (2000). The hysteretic Hopfield neural network. IEEE Transactions on Neural Networks. 11:4. (879-888). Online publication date: 1-Jul-2000.

    https://doi.org/10.1109/72.857769

  • Siegel E. Iambic IBM AI. Proceedings of the thirty-first SIGCSE technical symposium on Computer science education. (95-99).

    https://doi.org/10.1145/330908.331823

  • Siegel E. (2000). Iambic IBM AI. ACM SIGCSE Bulletin. 32:1. (95-99). Online publication date: 1-Mar-2000.

    https://doi.org/10.1145/331795.331823

  • Gupta D. (2000). Dynamic variable ordering in graph based backjumping algorithms for csps. International Journal of Computer Mathematics. 10.1080/00207160008804975. 75:2. (167-186). Online publication date: 1-Jan-2000.

    http://www.tandfonline.com/doi/abs/10.1080/00207160008804975

  • Wiratunga N and Craw S. (2000). Sequencing Training Examples for Iterative Knowledge Refinement. Research and Development in Intelligent Systems XVI. 10.1007/978-1-4471-0745-3_3. (41-56).

    http://link.springer.com/10.1007/978-1-4471-0745-3_3

  • Krishnamoorthy M and Valois J. (1999). Macros. Wiley Encyclopedia of Electrical and Electronics Engineering. 10.1002/047134608X.W1657.

    https://onlinelibrary.wiley.com/doi/10.1002/047134608X.W1657

  • Gu J. (1999). The Multi-SAT algorithm. Discrete Applied Mathematics. 96-97:1. (111-126). Online publication date: 15-Oct-1999.

    https://doi.org/10.1016/S0166-218X(99)00035-9

  • Frost D and Dechter R. (1999). Maintenance scheduling problems as benchmarks for constraint algorithms. Annals of Mathematics and Artificial Intelligence. 26:1-4. (149-170). Online publication date: 10-Sep-1999.

    https://doi.org/10.1023/A:1018906911996

  • Miguel I and Shen Q. (1999). Hard, flexible and dynamic constraint satisfaction. The Knowledge Engineering Review. 14:3. (199-220). Online publication date: 1-Sep-1999.

    https://doi.org/10.1017/S0269888999003070

  • Zhao Q and Goebel R. (1999). Algorithms for handling soft constraints and their applications to staff scheduling problems. International Journal of Intelligent Systems in Accounting, Finance & Management. 10.1002/(SICI)1099-1174(199906)8:2<119::AID-ISAF165>3.0.CO;2-N. 8:2. (119-129). Online publication date: 1-Jun-1999.

    http://doi.wiley.com/10.1002/%28SICI%291099-1174%28199906%298%3A2%3C119%3A%3AAID-ISAF165%3E3.0.CO%3B2-N

  • Cheng B, Choi K, Lee J and Wu J. (1999). Increasing Constraint Propagation by Redundant Modeling. Constraints. 4:2. (167-192). Online publication date: 1-May-1999.

    https://doi.org/10.1023/A:1009894810205

  • Gu J, Gu Q and Du D. (2023). On optimizing the satisfiability (SAT) problem. Journal of Computer Science and Technology. 14:1. (1-17). Online publication date: 1-Jan-1999.

    https://doi.org/10.1007/BF02952482

  • Wiratunga N and Craw S. (1999). Incorporating Backtracking in Knowledge Refinement. Validation and Verification of Knowledge Based Systems. 10.1007/978-1-4757-6916-6_13. (193-205).

    http://link.springer.com/10.1007/978-1-4757-6916-6_13

  • Gu J, Purdom P, Franco J and Wah B. (1999). Algorithms for the Satisfiability (SAT) Problem. Handbook of Combinatorial Optimization. 10.1007/978-1-4757-3023-4_7. (379-572).

    http://link.springer.com/10.1007/978-1-4757-3023-4_7

  • Gu J. (1999). Parallel Algorithms for Satisfiability (SAT) Testing. Parallel Processing of Discrete Problems. 10.1007/978-1-4612-1492-2_5. (85-138).

    http://link.springer.com/10.1007/978-1-4612-1492-2_5

  • Wang J. (1998). Backtracking tactics in the backtrack method for SAT. Mathematical and Computer Modelling: An International Journal. 28:2. (1-12). Online publication date: 21-Jul-1998.

    https://doi.org/10.1016/S0895-7177(98)00087-9

  • Bharitkar S and Mendel J. The hysteretic Hopfield neural network ICNN '98 - International Conference on Neural Networks. 10.1109/IJCNN.1998.686023. 0-7803-4859-1. (1634-1639).

    http://ieeexplore.ieee.org/document/686023/

  • Pardalos P, Mavridou T and Xue J. (1998). The Graph Coloring Problem: A Bibliographic Survey. Handbook of Combinatorial Optimization. 10.1007/978-1-4613-0303-9_16. (1077-1141).

    http://link.springer.com/10.1007/978-1-4613-0303-9_16

  • Frost D, Rish I and Vila L. Summarizing CSP hardness with continuous probability distributions. Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence. (327-333).

    /doi/10.5555/1867406.1867457

  • Likas A, Papageorgiou G and Stafylopatis A. (1997). A Connectionist Approach for Solving Large ConstraintSatisfaction Problems. Applied Intelligence. 7:3. (215-225). Online publication date: 1-Jul-1997.

    https://doi.org/10.1023/A:1008272531960

  • Cheng B, Lee J and Wu J. (1997). A nurse rostering system using constraint programming and redundant modeling. IEEE Transactions on Information Technology in Biomedicine. 1:1. (44-54). Online publication date: 1-Mar-1997.

    https://doi.org/10.1109/4233.594027

  • Kondrak G and van Beek P. (1997). A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence. 89:1-2. (365-387). Online publication date: 15-Jan-1997.

    https://doi.org/10.1016/S0004-3702(96)00027-6

  • Purdom P. (1997). Backtracking and random constraint satisfaction. Annals of Mathematics and Artificial Intelligence. 20:1-4. (393-410). Online publication date: 9-Jan-1997.

    https://doi.org/10.1023/A:1018944814355

  • Yang C and Ming-Hsuan Yang . Constraint networks: a survey 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation. 10.1109/ICSMC.1997.638351. 0-7803-4053-1. (1930-1935).

    http://ieeexplore.ieee.org/document/638351/

  • Farkas J and Jármai K. (1997). Backtrack Method with Applications to Dso. Discrete Structural Optimization. 10.1007/978-3-7091-2754-4_4. (167-231).

    http://link.springer.com/10.1007/978-3-7091-2754-4_4

  • Tsuneto R, Nau D and Hendler J. (1997). Plan-refinement strategies and search-space size. Recent Advances in AI Planning. 10.1007/3-540-63912-8_103. (414-426).

    http://link.springer.com/10.1007/3-540-63912-8_103

  • Pang W and Goodwin S. (1997). Constraint-directed backtracking. Advanced Topics in Artificial Intelligence. 10.1007/3-540-63797-4_57. (47-56).

    http://link.springer.com/10.1007/3-540-63797-4_57

  • Sadeh N and Fox M. (1996). Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence. 86:1. (1-41). Online publication date: 1-Sep-1996.

    https://doi.org/10.1016/0004-3702(95)00098-4

  • Minton S. (1996). Automatically configuring constraint satisfaction programs: A case study. Constraints. 10.1007/BF00143877. 1:1-2. (7-43). Online publication date: 1-Sep-1996.

    http://link.springer.com/10.1007/BF00143877

  • Cheng B, Lee J and Wu J. Speeding up constraint propagation by redundant modeling. Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming. (91-103).

    https://doi.org/10.1007/3-540-61551-2_68

  • (1996). Constraint Propagation Based Scheduling of Job Shops. INFORMS Journal on Computing. 8:2. (144-157). Online publication date: 1-May-1996.

    https://doi.org/10.1287/ijoc.8.2.144

  • Gu J, Gu Q and Du D. (1996). Convergence Properties of Optimization Algorithms for the SAT Problem. IEEE Transactions on Computers. 45:2. (209-218). Online publication date: 1-Feb-1996.

    https://doi.org/10.1109/12.485373

  • van Beek P and Manchak D. (1996). The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research. 4:1. (1-18). Online publication date: 1-Jan-1996.

    /doi/10.5555/1622737.1622738

  • Kondrak G and Van Beek P. A theoretical evaluation of selected backtracking algorithms. Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1. (541-547).

    /doi/10.5555/1625855.1625926

  • Helsgaun K. (1995). CBack. Software—Practice & Experience. 25:8. (905-934). Online publication date: 1-Aug-1995.

    https://doi.org/10.1002/spe.4380250805

  • Sadeh N, Sycara K and Xiong Y. (1995). Backtracking techniques for the job shop scheduling constraint satisfaction problem. Artificial Intelligence. 76:1-2. (455-480). Online publication date: 1-Jul-1995.

    https://doi.org/10.1016/0004-3702(95)00078-S

  • Lee J, Leung H and Won H. Extending GENET for non-binary CSP's 7th IEEE International Conference on Tools with Artificial Intelligence. 10.1109/TAI.1995.479651. 0-8186-7312-5. (338-343).

    http://ieeexplore.ieee.org/document/479651/

  • Bacchus F and Grove A. (1995). On the forward checking algorithm. Principles and Practice of Constraint Programming — CP '95. 10.1007/3-540-60299-2_18. (292-309).

    http://link.springer.com/10.1007/3-540-60299-2_18

  • Bacchus F and Run P. (1995). Dynamic variable ordering in CSPs. Principles and Practice of Constraint Programming — CP '95. 10.1007/3-540-60299-2_16. (258-275).

    http://link.springer.com/10.1007/3-540-60299-2_16

  • Prosser P. (1995). Forward checking with backmarking. Constraint Processing. 10.1007/3-540-59479-5_26. (185-204).

    http://link.springer.com/10.1007/3-540-59479-5_26

  • Sosič R. (1994). History cache. ACM SIGARCH Computer Architecture News. 22:5. (11-18). Online publication date: 1-Dec-1994.

    https://doi.org/10.1145/192537.192541

  • Gu J, Huang X and Du B. (1994). A quantitative solution to Constraint Satisfaction Problem (CSP). New Generation Computing. 13:1. (99-115). Online publication date: 1-Dec-1994.

    https://doi.org/10.1007/BF03038310

  • Sosic R and Gu J. (1994). Efficient Local Search with Conflict Minimization. IEEE Transactions on Knowledge and Data Engineering. 6:5. (661-668). Online publication date: 1-Oct-1994.

    https://doi.org/10.1109/69.317698

  • Cull P and Pandey R. (1994). Isomorphism and the N-Queens problem. ACM SIGCSE Bulletin. 26:3. (29-36). Online publication date: 1-Sep-1994.

    https://doi.org/10.1145/187387.187400

  • Pesch E, Drexl A and Kolen A. (1994). Modellbasierte Inferenz in CHARME. OR Spectrum. 16:3. (193-202). Online publication date: 1-Sep-1994.

    https://doi.org/10.1007/BF01720708

  • Frost D and Dechter R. In search of the best constraint satisfaction search. Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence. (301-306).

    /doi/10.5555/2891730.2891776

  • Gu J. (1994). Global Optimization for Satisfiability (SAT) Problem. IEEE Transactions on Knowledge and Data Engineering. 6:3. (361-381). Online publication date: 1-Jun-1994.

    https://doi.org/10.1109/69.334864

  • Qi Zhao . An efficient method of solving constraint satisfaction problems in IR spectrum interpreting International Conference on Expert Systems for Development. 10.1109/ICESD.1994.302287. 0-8186-5780-4. (165-170).

    http://ieeexplore.ieee.org/document/302287/

  • Gu J. (1994). Optimization Algorithms for the Satisfiability (SAT) Problem. Advances in Optimization and Approximation. 10.1007/978-1-4613-3629-7_6. (72-154).

    http://link.springer.com/10.1007/978-1-4613-3629-7_6

  • Ricci F. (1994). Constraint reasoning with learning automata. International Journal of Intelligent Systems. 10.1002/int.4550091203. 9:12. (1059-1082).

    http://doi.wiley.com/10.1002/int.4550091203

  • Prosser P. Domain filtering can degrade intelligent backtracking search. Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1. (262-267).

    /doi/10.5555/1624025.1624062

  • Prosser P. (1993). HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM. Computational Intelligence. 10.1111/j.1467-8640.1993.tb00310.x. 9:3. (268-299). Online publication date: 1-Aug-1993.

    https://onlinelibrary.wiley.com/doi/10.1111/j.1467-8640.1993.tb00310.x

  • Chu W and Ngai P. (2009). Embedding temporal constraint propagation in machine sequencing for job shop scheduling. Artificial Intelligence for Engineering, Design, Analysis and Manufacturing. 10.1017/S0890060400000056. 7:01. (37). Online publication date: 1-Feb-1993.

    http://www.journals.cambridge.org/abstract_S0890060400000056

  • Prosser P. BM + BJ = BMJ 9th IEEE Conference on Artificial Intelligence for Applications. 10.1109/CAIA.1993.366602. 0-8186-3840-0. (257-262).

    http://ieeexplore.ieee.org/document/366602/

  • (1993). Bibliography. Foundations of Constraint Satisfaction. 10.1016/B978-0-12-701610-8.50020-3. (383-403).

    https://linkinghub.elsevier.com/retrieve/pii/B9780127016108500203

  • Sonka M, Hlavac V and Boyle R. (1993). Object recognition. Image Processing, Analysis and Machine Vision. 10.1007/978-1-4899-3216-7_7. (255-315).

    http://link.springer.com/10.1007/978-1-4899-3216-7_7

  • Minton S, Johnston M, Philips A and Laird P. (1992). Minimizing conflicts. Artificial Intelligence. 58:1-3. (161-205). Online publication date: 1-Dec-1992.

    https://doi.org/10.1016/0004-3702(92)90007-K

  • Hu T, Tang C and Lee R. (1992). An average case analysis of a resolution principle algorithm in mechanical theorem proving. Annals of Mathematics and Artificial Intelligence. 10.1007/BF01531030. 6:1-3. (235-251). Online publication date: 1-Mar-1992.

    http://link.springer.com/10.1007/BF01531030

  • Cullen P, Hull J and Srihari S. A constraint satisfaction approach to the resolution of uncertainty in image interpretation Eighth Conference on Artificial Intelligence for Applications. 10.1109/CAIA.1992.200020. 0-8186-2690-9. (127-133).

    http://ieeexplore.ieee.org/document/200020/

  • Takefuji Y. (1992). Neural Network Models and N-Queen Problems. Neural Network Parallel Computing. 10.1007/978-1-4615-3642-0_1. (1-26).

    http://link.springer.com/10.1007/978-1-4615-3642-0_1

  • McDiarmid C and Provan G. An expected-cost analysis of backtracking and non-backtracking algorithms. Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1. (172-177).

    /doi/10.5555/1631171.1631197

  • Kalé L and Saletore V. (1991). Parallel state-space search for a first solution with consistent linear speedups. International Journal of Parallel Programming. 19:4. (251-293). Online publication date: 1-Aug-1991.

    https://doi.org/10.1007/BF01379360

  • Atabakhsh H. (1991). A survey of constraint based scheduling systems using an artificial intelligence approach. Artificial Intelligence in Engineering. 10.1016/0954-1810(91)90001-5. 6:2. (58-73). Online publication date: 1-Apr-1991.

    http://linkinghub.elsevier.com/retrieve/pii/0954181091900015

  • Sycara K, Roth S, Sadeh N and Fox M. (1991). Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics. 10.1109/21.135688. 21:6. (1446-1461). Online publication date: 1-Jan-1991.

    http://ieeexplore.ieee.org/document/135688/

  • Hu T, Tang C and Lee R. (1991). An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm. ISA'91 Algorithms. 10.1007/3-540-54945-5_55. (116-126).

    http://link.springer.com/10.1007/3-540-54945-5_55

  • Wiedermann J. (1991). Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines. Fundamentals of Artificial Intelligence Research. 10.1007/3-540-54507-7_6. (59-70).

    http://link.springer.com/10.1007/3-540-54507-7_6

  • Feldman R and Golumbic M. (1990). Interactive scheduling as a constraint satisfiability problem. Annals of Mathematics and Artificial Intelligence. 1:1-4. (49-73). Online publication date: 1-Sep-1990.

    https://doi.org/10.1007/BF01531070

  • Minton S, Johnston M, Philips A and Laird P. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. Proceedings of the eighth National conference on Artificial intelligence - Volume 1. (17-24).

    /doi/10.5555/1865499.1865502

  • Nadel B. (1990). Constraint satisfaction algorithms. Computational Intelligence. 5:4. (188-224). Online publication date: 1-May-1990.

    https://doi.org/10.1111/j.1467-8640.1989.tb00328.x

  • Kalé L. (1990). An almost perfect heuristic for the N nonattacking queens problem. Information Processing Letters. 34:4. (173-178). Online publication date: 24-Apr-1990.

    https://doi.org/10.1016/0020-0190(90)90156-R

  • Stanelle S and Fu L. Analysis of three algorithms for finding all consistent labelings 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference. 10.1109/ICSMC.1990.142184. 0-87942-597-0. (605-610).

    http://ieeexplore.ieee.org/document/142184/

  • Galle P. (1989). Branch & sample: A simple strategy for constraint satisfaction. BIT. 29:3. (395-408). Online publication date: 1-Sep-1989.

    https://doi.org/10.1007/BF02219227

  • Feldman R and Golumbic M. Constraint satisfiability algorithms for interactive student scheduling. Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2. (1010-1016).

    /doi/10.5555/1623891.1623917

  • Keng N and Yun D. A planning/scheduling methodology for the constrained resource problem. Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2. (998-1003).

    /doi/10.5555/1623891.1623915

  • Brown C, Finkelstein L and Purdom P. (1989). Backtrack searching in the presence of symmetry. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. 10.1007/3-540-51083-4_51. (99-110).

    http://link.springer.com/10.1007/3-540-51083-4_51

  • Chu W and Ngai P. A dynamic constraint-directed ordered search algorithm for solving constraint satisfaction problems. Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1. (116-125).

    https://doi.org/10.1145/51909.52120

  • Nicol D. (1988). Expected performance of m-solution backtracking. SIAM Journal on Computing. 17:1. (114-127). Online publication date: 1-Feb-1988.

    https://doi.org/10.1137/0217008

  • Nadel B. (1988). Tree Search and ARC Consistency in Constraint Satisfaction Algorithms. Search in Artificial Intelligence. 10.1007/978-1-4613-8788-6_9. (287-342).

    http://link.springer.com/10.1007/978-1-4613-8788-6_9

  • Freuder E. (1988). Backtrack-Free and Backtrack-Bounded Search. Search in Artificial Intelligence. 10.1007/978-1-4613-8788-6_10. (343-369).

    http://link.springer.com/10.1007/978-1-4613-8788-6_10

  • Stone H and Stone J. (1987). Efficient search techniques—an empirical study of the N-Queens problem. IBM Journal of Research and Development. 31:4. (464-474). Online publication date: 1-Jul-1987.

    https://doi.org/10.1147/rd.314.0464

  • Gu W, Yang J and Huang T. (1987). Matching perspective views of a polyhedron using circuits. IEEE Transactions on Pattern Analysis and Machine Intelligence. 9:3. (390-400). Online publication date: 1-May-1987.

    https://doi.org/10.1109/TPAMI.1987.4767921

  • Brown C, Finkelstein L and Purdom P. Intelligent backtracking using symmetry. Proceedings of 1986 ACM Fall joint computer conference. (576-584).

    /doi/10.5555/324493.324615

  • Carter L, Stockmeyer L and Wegman M. The complexity of backtrack searches. Proceedings of the seventeenth annual ACM symposium on Theory of computing. (449-457).

    https://doi.org/10.1145/22145.22195

  • Freuder E. (1985). A sufficient condition for backtrack-bounded search. Journal of the ACM. 32:4. (755-761). Online publication date: 1-Oct-1985.

    https://doi.org/10.1145/4221.4225

  • Yang W and Du M. (1985). A backtracking method for constructing perfect hash functions from a set of mapping functions. BIT. 25:1. (148-164). Online publication date: 1-Mar-1985.

    https://doi.org/10.1007/BF01934995

  • Wagner R and Geist R. (1984). The crippled queen placement problem. Science of Computer Programming. 4:3. (221-248). Online publication date: 1-Dec-1984.

    https://doi.org/10.1016/0167-6423(84)90001-7

  • Purdom, Jr. P and Brown C. (1983). An Analysis of Backtracking with Search Rearrangement. SIAM Journal on Computing. 12:4. (717-733). Online publication date: 1-Nov-1983.

    https://doi.org/10.1137/0212049

  • Kearns J and Lou Soffa M. (1983). The implementation of retention in a coroutine environment. Acta Informatica. 19:3. (221-223). Online publication date: 1-Jul-1983.

    https://doi.org/10.1007/BF00265556

  • Fowler G, Haralick R, Gray F, Feustel C and Grinstead C. (1983). Efficient graph automorphism by vertex partitioning. Artificial Intelligence. 10.1016/S0004-3702(83)80012-5. 21:1-2. (245-269). Online publication date: 1-Mar-1983.

    http://linkinghub.elsevier.com/retrieve/pii/S0004370283800125

  • Purdom P. (1983). Search rearrangement backtracking and polynomial average time. Artificial Intelligence. 21:1-2. (117-133). Online publication date: 1-Mar-1983.

    https://doi.org/10.1016/S0004-3702(83)80007-1

  • Neff N. (1983). Recursive Algorithms in Statistics. Computer Science and Statistics: Proceedings of the 14th Symposium on the Interface. 10.1007/978-1-4612-5545-1_51. (295-297).

    http://link.springer.com/10.1007/978-1-4612-5545-1_51

  • Gait J. (2006). An algorithm for an efficient command interpreter. Software: Practice and Experience. 10.1002/spe.4380121011. 12:10. (981-982). Online publication date: 1-Oct-1982.

    https://onlinelibrary.wiley.com/doi/10.1002/spe.4380121011

  • Goldberg A, Purdom P and Brown C. (1982). Average time analysis of simplified Davis-Putnam procedures. Information Processing Letters. 10.1016/0020-0190(82)90110-7. 15:2. (72-75). Online publication date: 1-Sep-1982.

    http://linkinghub.elsevier.com/retrieve/pii/0020019082901107

  • Brown C and Purdom P. An Empirical Comparison of Backtracking Algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence. 10.1109/TPAMI.1982.4767250. PAMI-4:3. (309-316).

    http://ieeexplore.ieee.org/document/4767250/

  • Freuder E. (1982). A Sufficient Condition for Backtrack-Free Search. Journal of the ACM. 29:1. (24-32). Online publication date: 1-Jan-1982.

    https://doi.org/10.1145/322290.322292

  • Kergall Y. (2011). Algorithmes polynomiaux pour la recherche d'un chemin optimal dans une scène planifiée. RAIRO - Operations Research. 10.1051/ro/1982160201311. 16:2. (131-154).

    http://www.rairo-ro.org/10.1051/ro/1982160201311

  • Pezzella F, Bonanno R and Nicoletti B. (1981). A system approach to the optimal health-care districting. European Journal of Operational Research. 10.1016/0377-2217(81)90253-8. 8:2. (139-146). Online publication date: 1-Oct-1981.

    http://linkinghub.elsevier.com/retrieve/pii/0377221781902538

  • Brown C and Purdom P. How to search efficiently. Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1. (588-594).

    /doi/10.5555/1623156.1623263

  • Brown C and Purdom, Jr. P. (1981). An Average Time Analysis of Backtracking. SIAM Journal on Computing. 10:3. (583-593). Online publication date: 1-Aug-1981.

    https://doi.org/10.1137/0210043

  • Purdom P, Brown C and Robertson E. (1981). Backtracking with multi-level dynamic search rearrangement. Acta Informatica. 15:2. (99-113). Online publication date: 1-Jun-1981.

    https://doi.org/10.1007/BF00288958

  • Ghahraman D, Wong A and Au T. Graph Optimal Monomorphism Algorithms. IEEE Transactions on Systems, Man, and Cybernetics. 10.1109/TSMC.1980.4308468. 10:4. (181-188).

    http://ieeexplore.ieee.org/document/4308468/

  • Cohen J. (1979). Non-Deterministic Algorithms. ACM Computing Surveys. 11:2. (79-94). Online publication date: 1-Jun-1979.

    https://doi.org/10.1145/356770.356773

  • Lindstrom G. (1979). Backtracking in a Generalized Control Setting. ACM Transactions on Programming Languages and Systems. 1:1. (8-26). Online publication date: 1-Jan-1979.

    https://doi.org/10.1145/357062.357063

  • Purdom P. (1978). Tree Size by Partial Backtracking. SIAM Journal on Computing. 7:4. (481-491). Online publication date: 1-Nov-1978.

    https://doi.org/10.1137/0207038

  • Lyon G. (1978). Packed scatter tables. Communications of the ACM. 21:10. (857-865). Online publication date: 1-Oct-1978.

    https://doi.org/10.1145/359619.359633

  • Bunting P, van Leeuwen J and Tamari D. (1978). Deciding associativity for partial multiplication tables of order 3. Mathematics of Computation. 10.1090/S0025-5718-1978-0498906-7. 32:142. (593-605).

    https://www.ams.org/mcom/1978-32-142/S0025-5718-1978-0498906-7/

  • Corneil D and Mathon R. (1978). Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations. Algorithmic Aspects of Combinatorics. 10.1016/S0167-5060(08)70319-4. (1-32).

    http://linkinghub.elsevier.com/retrieve/pii/S0167506008703194

  • Robertson A and Hamming M. (1977). MASSFORM: A computer program for the assignment of elemental compositions to high resolution mass spectral data. Biological Mass Spectrometry. 10.1002/bms.1200040403. 4:4. (203-208). Online publication date: 1-Aug-1977.

    http://doi.wiley.com/10.1002/bms.1200040403

  • Jones W and Dyre M. META: An Algorithm for the Analysis of Multilevel Energy Transport Systems. IEEE Transactions on Systems, Man, and Cybernetics. 10.1109/TSMC.1977.4309698. 7:4. (243-247).

    http://ieeexplore.ieee.org/document/4309698/

  • Gerhart S and Yelowitz L. (1976). Control Structure Abstractions of the Backtracking Programming Technique. IEEE Transactions on Software Engineering. 2:4. (285-292). Online publication date: 1-Jul-1976.

    https://doi.org/10.1109/TSE.1976.233834