default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKostas Stergiou 0001
Person information
- affiliation: University of Western Macedonia, Greece
- affiliation (former): University of the Aegean, Greece
- affiliation (PhD 2001): University of Strathclyde, Glasgow, UK
Other persons with the same name
- Konstantinos Stergiou — disambiguation page
- Konstantinos Stergiou 0002 — TU Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2001
[b1]Kostas Stergiou:
Representation and reasoning with non-binary constraints. University of Strathclyde, Glasgow, UK, 2001
Journal Articles
- 2024
- [j23]Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh:
Corrigendum to "Learning constraints through partial queries" [Artificial Intelligence 319 (2023) 103896]. Artif. Intell. 328: 104075 (2024) - 2023
- [j22]Christian Bessiere
, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh:
Learning constraints through partial queries. Artif. Intell. 319: 103896 (2023) - 2021
- [j21]Kostas Stergiou:
Adaptive constraint propagation in constraint satisfaction: review and evaluation. Artif. Intell. Rev. 54(7): 5055-5093 (2021) - 2020
- [j20]Dimosthenis C. Tsouros, Kostas Stergiou:
Efficient multiple constraint acquisition. Constraints An Int. J. 25(3-4): 180-225 (2020) - 2019
- [j19]Kostas Stergiou:
Neighborhood singleton consistencies. Constraints An Int. J. 24(1): 94-131 (2019) - 2018
- [j18]Minas Dasygenis, Kostas Stergiou:
Methods for Parallelizing Constraint Propagation through the Use of Strong Local Consistencies. Int. J. Artif. Intell. Tools 27(4): 1860002:1-1860002:27 (2018) - 2017
- [j17]Kostas Stergiou:
Revisiting restricted path consistency. Constraints An Int. J. 22(3): 377-402 (2017) - 2016
- [j16]Anastasia Paparrizou, Kostas Stergiou:
Strong local consistency algorithms for table constraints. Constraints An Int. J. 21(2): 163-197 (2016) - 2012
- [j15]Panagiotis Karagiannis, George A. Vouros, Kostas Stergiou, Nikolaos Samaras:
Overlay networks for task allocation and coordination in large-scale networks of cooperative agents. Auton. Agents Multi Agent Syst. 24(1): 26-68 (2012) - 2011
- [j14]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh:
New algorithms for max restricted path consistency. Constraints An Int. J. 16(4): 372-406 (2011) - 2010
- [j13]Thanasis Balafoutis, Kostas Stergiou:
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs. Fundam. Informaticae 102(3-4): 229-261 (2010) - 2009
- [j12]Kostas Stergiou:
Heuristics for dynamically adapting propagation in constraint satisfaction problems. AI Commun. 22(3): 125-141 (2009) - [j11]Enrico Giunchiglia, Kostas Stergiou:
Introduction to the special issue on quantified CSPs and QBF. Constraints An Int. J. 14(1): 1-2 (2009) - 2008
- [j10]Ian P. Gent, Peter Nightingale, Andrew G. D. Rowley, Kostas Stergiou:
Solving quantified constraint satisfaction problems. Artif. Intell. 172(6-7): 738-771 (2008) - [j9]Christian Bessiere, Kostas Stergiou, Toby Walsh:
Domain filtering consistencies for non-binary constraints. Artif. Intell. 172(6-7): 800-822 (2008) - [j8]Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras, Konstantinos Stergiou:
Worst case examples of an exterior point algorithm for the assignment problem. Discret. Optim. 5(3): 605-614 (2008) - [j7]Kostas Stergiou:
Preprocessing Quantified Constraint Satisfaction Problems with Value Reordering and Directional Arc and Path Consistency. Int. J. Artif. Intell. Tools 17(2): 321-337 (2008) - [j6]Kostas Stergiou:
Strong Domain Filtering Consistencies for Non-Binary Constraint Satisfaction Problems. Int. J. Artif. Intell. Tools 17(5): 781-802 (2008) - 2006
- [j5]Konstantinos Kotis, George A. Vouros, Konstantinos Stergiou:
Towards automatic merging of domain ontologies: The HCONE-merge approach. J. Web Semant. 4(1): 60-79 (2006) - 2005
- [j4]Paraskevi Raftopoulou, Manolis Koubarakis, Kostas Stergiou, Peter Triantafillou:
Fair Resource Allocation in a Simple Multi-agent Setting: Search Algorithms and Experimental Evaluation. Int. J. Artif. Intell. Tools 14(6): 887-900 (2005) - [j3]Kostas Stergiou, Nikos Samaras:
Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results. J. Artif. Intell. Res. 24: 641-684 (2005) - 2000
- [j2]Kostas Stergiou, Manolis Koubarakis:
Backtracking algorithms for disjunctions of temporal constraints. Artif. Intell. 120(1): 81-117 (2000) - [j1]Ian P. Gent, Kostas Stergiou, Toby Walsh:
Decomposable constraints. Artif. Intell. 123(1-2): 133-156 (2000)
Conference and Workshop Papers
- 2024
- [c45]Panteleimon Iosif, Nikolaos Ploskas, Kostas Stergiou, Dimosthenis C. Tsouros:
A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance Constraints. CP 2024: 14:1-14:21 - 2023
- [c44]Nikolaos Ploskas, Kostas Stergiou, Dimosthenis C. Tsouros:
The p-Dispersion Problem with Distance Constraints. CP 2023: 30:1-30:18 - 2022
- [c43]Malamati D. Louta, Fokion Papathanasiou, Petros Damos, Nikolaos Ploskas, Minas Dasygenis, Thomas S. Kyriakidis, Vasileios Balafas, Antonios Chatzisavvas, Ioanna Karampelia, Emmanouil Karantoumanis, Nikolaos Mantas, Nikos Dimokas, Vassilios Lazaridis, Ioannis Vandikas, Kostas Stergiou, Pantelis A. Angelidis, Evangelos Tsikos:
Intelligent Pesticide and Irrigation Management in Precision Agriculture: The Case of VELOS Project. HAICTA 2022: 91-99 - 2021
- [c42]Dimosthenis C. Tsouros, Kostas Stergiou:
Learning Max-CSPs via Active Constraint Acquisition. CP 2021: 54:1-54:18 - [c41]John Gialelis, Vassilis Tsakanikas, Nikos Tsafas, Kostas Stergiou, Vasilis Triantafyllou:
MeAct: A Non-obstructive Persuasive End-to-End Platform for Active and Healthy Ageing Support. MobiQuitous 2021: 860-871 - 2020
- [c40]Dimosthenis C. Tsouros, Kostas Stergiou, Christian Bessiere:
Omissions in Constraint Acquisition. CP 2020: 935-951 - 2019
- [c39]Dimosthenis C. Tsouros, Kostas Stergiou, Christian Bessiere:
Structure-Driven Multiple Constraint Acquisition. CP 2019: 709-725 - 2018
- [c38]Dimosthenis C. Tsouros, Kostas Stergiou, Panagiotis G. Sarigiannidis:
Efficient Methods for Constraint Acquisition. CP 2018: 373-388 - 2017
- [c37]Anastasia Paparrizou, Kostas Stergiou:
On Neighborhood Singleton Consistencies. IJCAI 2017: 736-742 - [c36]Minas Dasygenis, Thanasis Karpouzis, Konstantinos Stergiou:
Template matching of a coarse grain reconfigurable architecture datapath using constraint programming. PCI 2017: 17:1-17:2 - 2016
- [c35]Minas Dasygenis, Kostas Stergiou:
Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies. SETN 2016: 2:1-2:7 - 2015
- [c34]Christian Bessiere, Anastasia Paparrizou, Kostas Stergiou:
Strong Bounds Consistencies and Their Application to Linear Constraints. AAAI 2015: 3717-3723 - [c33]Kostas Stergiou:
Restricted Path Consistency Revisited. CP 2015: 419-428 - 2014
- [c32]Minas Dasygenis, Kostas Stergiou:
Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied. ICTAI 2014: 717-724 - 2013
- [c31]Christophe Lecoutre, Anastasia Paparrizou, Kostas Stergiou:
Extending STR to a Higher-Order Consistency. AAAI 2013: 576-582 - 2012
- [c30]Anastasia Paparrizou, Kostas Stergiou:
An Efficient Higher-Order Consistency Algorithm for Table Constraints. AAAI 2012: 535-541 - [c29]Anastasia Paparrizou, Kostas Stergiou:
Evaluating Simple Fully Automated Heuristics for Adaptive Constraint Propagation. ICTAI 2012: 880-885 - [c28]Anastasia Paparrizou, Kostas Stergiou:
Extending Generalized Arc Consistency. SETN 2012: 174-181 - 2010
- [c27]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh:
Improving the Performance of maxRPC. CP 2010: 69-83 - [c26]Thanasis Balafoutis, Kostas Stergiou:
Adaptive Branching for Constraint Satisfaction Problems. ECAI 2010: 855-860 - [c25]Thanasis Balafoutis, Kostas Stergiou:
Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems. SETN 2010: 29-38 - 2009
- [c24]Efstathios Stamatatos, Kostas Stergiou:
Learning How to Propagate Using Random Probing. CPAIOR 2009: 263-278 - 2008
- [c23]Kostas Stergiou:
Heuristics for Dynamically Adapting Propagation. ECAI 2008: 485-489 - [c22]Thanasis Balafoutis, Kostas Stergiou:
Experimental Evaluation of Modern Variable Selection Strategies in Constraint Satisfaction Problems. RCRA 2008 - [c21]Yannis Argyropoulos, Kostas Stergiou:
A Study of SAT-Based Branching Heuristics for the CSP. SETN 2008: 38-50 - 2007
- [c20]Christina Theocharopoulou, Ioannis Partsakoulakis, George A. Vouros, Kostas Stergiou:
Overlay networks for task allocation and coordination in dynamic large-scale networks of cooperative agents. AAMAS 2007: 55 - [c19]Fahiem Bacchus, Kostas Stergiou:
Solution Directed Backjumping for QCSP. CP 2007: 148-163 - [c18]Kostas Stergiou:
Strong Inverse Consistencies for Non-Binary CSPs. ICTAI (1) 2007: 215-222 - 2006
- [c17]Thanasis Balafoutis, Kostas Stergiou:
Algorithms for Stochastic CSPs. CP 2006: 44-58 - [c16]Yannis Dimopoulos, Kostas Stergiou:
Propagation in CSP and SAT. CP 2006: 137-151 - [c15]Kostas Stergiou, Toby Walsh:
Inverse Consistencies for Non-Binary Constraints. ECAI 2006: 153-157 - 2005
- [c14]Kostas Stergiou:
Repair-Based Methods for Quantified CSPs. CP 2005: 652-666 - [c13]Ian P. Gent, Peter Nightingale, Kostas Stergiou:
QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. IJCAI 2005: 138-143 - 2004
- [c12]Konstantinos Kotis, George A. Vouros, Kostas Stergiou:
Capturing Semantics Towards Automatic Coordination of Domain Ontologies. AIMSA 2004: 22-32 - [c11]Nikos Mamoulis, Kostas Stergiou:
Constraint Satisfaction in Semi-structured Data Graphs. CP 2004: 393-407 - [c10]Nikos Mamoulis, Kostas Stergiou:
Algorithms for Quantified Constraint Satisfaction Problems. CP 2004: 752-756 - [c9]Nikos Samaras, Kostas Stergiou:
Arc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation. SETN 2004: 352-361 - 2002
- [c8]Kostas Stergiou:
On Algorithms for Decomposable Constraints. SETN 2002: 65-71 - 2001
- [c7]Nikos Mamoulis, Kostas Stergiou:
Solving Non-binary CSPs Using the Hidden Variable Encoding. CP 2001: 168-182 - 2000
- [c6]Barbara M. Smith, Kostas Stergiou, Toby Walsh:
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems. AAAI/IAAI 2000: 182-187 - [c5]Patrick Prosser, Kostas Stergiou, Toby Walsh:
Singleton Consistencies. CP 2000: 353-368 - 1999
- [c4]Kostas Stergiou, Toby Walsh:
Encodings of Non-Binary Constraint Satisfaction Problems. AAAI/IAAI 1999: 163-168 - [c3]Ian P. Gent, Kostas Stergiou, Toby Walsh:
Decomposable Constraints. New Trends in Constraints 1999: 134-149 - [c2]Kostas Stergiou, Toby Walsh:
The Difference All-Difference Makes. IJCAI 1999: 414-419 - 1998
- [c1]Kostas Stergiou, Manolis Koubarakis:
Backtracking Algorithms for Disjunctions of Temporal Constraints. AAAI/IAAI 1998: 248-253
Editorship
- 2019
- [e1]Louis-Martin Rousseau, Kostas Stergiou:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings. Lecture Notes in Computer Science 11494, Springer 2019, ISBN 978-3-030-19211-2 [contents]
Informal and Other Publications
- 2021
- [i8]Dimosthenis C. Tsouros, Kostas Stergiou:
Efficient Multiple Constraint Acquisition. CoRR abs/2109.05920 (2021) - 2020
- [i7]Christian Bessiere, Clément Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh:
Partial Queries for Constraint Acquisition. CoRR abs/2003.06649 (2020) - 2017
- [i6]Minas Dasygenis, Kostas Stergiou:
Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization. CoRR abs/1705.05316 (2017) - 2011
- [i5]Nikos Samaras, Konstantinos Stergiou:
Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results. CoRR abs/1109.5714 (2011) - 2010
- [i4]Thanasis Balafoutis, Kostas Stergiou:
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs. CoRR abs/1008.0659 (2010) - [i3]Thanasis Balafoutis, Kostas Stergiou:
Adaptive Branching for Constraint Satisfaction Problems. CoRR abs/1008.0660 (2010) - [i2]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh:
Improving the Performance of maxRPC. CoRR abs/1008.5189 (2010) - [i1]Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou:
Experimental Evaluation of Branching Schemes for the CSP. CoRR abs/1009.0407 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
