Integrating Constraints and Concurrent Objects in Musical Applications: A Calculus and its Visual Language. - Camilo Rueda; Gloria Alvarez; Luis Quesada 001; Gabriel Tamura; Frank D. Valencia; Juan Francisco Díaz; Gérard Assayag (Constraints An Int. J., 2001)

A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles. - Luis Quesada 001; Peter Van Roy (CP, 2002)

Speeding Up Constrained Path Solvers with a Reachability Propagator. - Luis Quesada 001; Peter Van Roy; Yves Deville (CP, 2005)

Using Dominators for Solving Constrained Path Problems. - Luis Quesada 001; Peter Van Roy; Yves Deville; Raphaël Collet (PADL, 2006)

Solving constrained graph problems using reachability constraints based on transitive closure and dominators / RÃ©solution de problÃ¨mes de graphes contraints Ã l'aide de contraintes d'atteignabilitÃ© basÃ©es sur la clÃ'ture transitive et les dominateurs. - Luis Quesada 001 (2007)

Personalisation of Telecommunications Services as Combinatorial Optimisation. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (AAAI, 2008)

Solving a Telecommunications Feature Subscription Configuration Problem. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (CP, 2008)

A BDD Approach to the Feature Subscription Problem. - Tarik Hadzic; David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (ECAI, 2008)

Consistency Techniques for Finding an Optimal Relaxation of a Feature Subscription. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (ICTAI (1), 2008)

Search Space Extraction. - Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (CP, 2009)

A Soft Global Precedence Constraint. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (IJCAI, 2009)

Context-Sensitive Call Control Using Constraints and Rules. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (CP, 2010)

A Generic Visualization Platform for CP. - Helmut Simonis; Paul Davern; Jacob Feldman; Deepak Mehta 001; Luis Quesada 001; Mats Carlsson (CP, 2010)

Improving the Global Constraint SoftPrec. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (ECAI, 2010)

Preferred Explanations for Quantified Constraint Satisfaction Problems. - Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (ICTAI (1), 2010)

Developing Approaches for Solving a Telecommunications Feature Subscription Problem. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (J. Artif. Intell. Res., 2010)

Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering. - Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (CP, 2011)

Designing Resilient Long-Reach Passive Optical Networks. - Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Marco Ruffini; David B. Payne; Linda Doyle (IAAI, 2011)

A Combinatorial Optimisation Approach to the Design of Dual Parented Long-Reach Passive Optical Networks. - Hadrien Cambazard; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Marco Ruffini; David B. Payne; Linda Doyle (ICTAI, 2011)

A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks - Hadrien Cambazard; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Marco Ruffini; David B. Payne; Linda Doyle (CoRR, 2011)

A Computational Geometry-Based Local Search Algorithm for Planar Location Problems. - Hadrien Cambazard; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (CPAIOR, 2012)

Deployment case studies of an energy efficient protected LR-PON architecture. - Marco Ruffini; Linda Doyle; David B. Payne; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (ONDM, 2012)

Deployment Strategies for Protected Long-Reach PON. - Marco Ruffini; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Linda Doyle; David B. Payne (JOCN, 2012)

Parallelising the k-Medoids Clustering Problem Using Space-Partitioning. - Alejandro Arbelaez; Luis Quesada 001 (SOCS, 2013)

Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (ICTAI, 2014)

Designing an Optical Island in the Core Network: From Routing to Spectrum Allocation. - Deepak Mehta 001; Barry O'Sullivan; Cemalettin Ozturk; Luis Quesada 001; Helmut Simonis (ICTAI, 2014)

A scalable optimisation approach to minimising IP protection capacity for Long-Reach PON. - Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Marco Ruffini; David B. Payne; Linda Doyle (ONDM, 2014)

An adaptive large neighbourhood search for designing transparent optical core network. - Deepak Mehta 001; Barry O'Sullivan; Cemalettin Ozturk; Luis Quesada 001 (ConTEL, 2015)

A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (CPAIOR, 2015)

Optimising dual homing for long-reach passive optical networks. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (DRCN, 2015)

Extending the Notion of Preferred Explanations for Quantified Constraint Satisfaction Problems. - Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (ICTAC, 2015)

A scalable approach for computing distance-bounded node-disjoint paths in optical networks. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Cemalettin Ozturk; Luis Quesada 001 (ICTON, 2015)

A constraint-based local search for designing tree networks with distance and disjoint constraints. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (RNDM@WMNC, 2015)

Computing distance-bounded node-disjoint paths for all pairs of nodes - An application to optical core network design. - Deepak Mehta 001; Barry O'Sullivan; Cemalletin Ozturk; Luis Quesada 001 (RNDM@WMNC, 2015)

A constraint programming approach to the additional relay placement problem in wireless sensor networks. - Luis Quesada 001; Lanny Sitanayah; Kenneth N. Brown; Barry O'Sullivan; Cormac J. Sreenan (Constraints An Int. J., 2015)

A Comparison between Two Optimisation Alternatives for Mapping in Wireless Network on Chip. - Maribell Sacanamboy; Luis Quesada 001; Freddy Bolanos; Álvaro Bernal Noreña; Barry O'Sullivan (ICTAI, 2016)

Comparing tree and chain topologies for designing resilient backhaul access network. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (ONDM, 2016)

Generation of a reference network for Ireland and its contribution to the design of an optical network architecture. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Ata Sasmaz (ICTON, 2017)

End-to-end network design and experimentation in the DISCUS project. - David B. Payne; Alejandro Arbelaez; René Bonk; Nick J. Doran; Marija Furdek; R. Jensen; Nick Parsons; Thomas Pfeiffer 001; Luis Quesada 001; Christian Raack; Giuseppe Talli; Paul D. Townsend; et al. (ICTON, 2017)

Access and Metro Network Convergence for Flexible End-to-End Network Design [Invited]. - Marco Ruffini; Mohand Achouche; Alejandro Arbelaez; René Bonk; Andrea Di Giglio; Nick J. Doran; Marija Furdek; R. Jensen; Julio Montalvo-Garcia; Nicholas Parsons; Thomas Pfeiffer 001; Luis Quesada 001; et al. (JOCN, 2017)

Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (Handbook of Parallel Constraint Reasoning, 2018)

An ontology-based approach to knowledge representation for Computer-Aided Control System Design. - Carmen Benavides; Isaías García 001; Héctor Alaiz-Moretón; Luis Quesada 001 (Data Knowl. Eng., 2018)

A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. - Alejandro Arbelaez; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001 (J. Heuristics, 2018)

Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH. - Maximilian Thiessen; Luis Quesada 001; Kenneth N. Brown (CPAIOR, 2020)

Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. - Mark Antunes; Vincent Armant; Kenneth N. Brown; Daniel A. Desmond; Guillaume Escamocher; Anne-Marie George; Diarmuid Grimes; Mike O'Keeffe; Yiqing Lin; Barry O'Sullivan; Cemalettin Ozturk; Luis Quesada 001; et al. (Int. J. Artif. Intell. Tools, 2020)

Ambient access control for smart spaces: dynamic guidance and zone configuration. - Seán Óg Murphy; Liam O'Toole; Luis Quesada 001; Kenneth N. Brown; Cormac J. Sreenan (ANT/EDI40, 2021)

Positive and Negative Length-Bound Reachability Constraints. - Luis Quesada 001; Kenneth N. Brown (CP, 2021)

An adaptive large neighbourhood search algorithm for diameter bounded network design problems. - Michele Garraffa; Deepak Mehta 001; Barry O'Sullivan; Cemalettin Ozturk; Luis Quesada 001 (J. Heuristics, 2021)

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. - Ágnes Cseh; Guillaume Escamocher; Begüm Genç; Luis Quesada 001 (Constraints An Int. J., 2022)

Pareto-Optimal Trace Generation from Declarative Process Models. - Juan Francisco Díaz; Hugo A. López 001; Luis Quesada 001; Juan C. Rosero (Business Process Management Workshops, 2023)

Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. - Ágnes Cseh; Guillaume Escamocher; Luis Quesada 001 (Constraints An Int. J., 2023)

Counterfactual Explanation Through Constraint Relaxation. - Sharmi Dev Gupta; Barry O'Sullivan; Luis Quesada 001 (ICTAI, 2024)