Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrás Z. Salamon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Christopher Stone
, András Z. Salamon, Ian Miguel:
A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models. ICGT 2024: 223-238- 2023
- [j6]András Z. Salamon, Michael Wehar:
Effective Guessing Has Unlikely Consequences. Theory Comput. Syst. 67(3): 548-568 (2023) - [i13]Joan Espasa, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Challenges in Modelling and Solving Plotting with PDDL. CoRR abs/2310.01470 (2023) - [i12]Joan Espasa, Ian P. Gent, Ian Miguel, Peter Nightingale, András Z. Salamon, Mateu Villaret:
Towards a Model of Puzznic. CoRR abs/2310.01503 (2023) - [i11]Ian Miguel, András Z. Salamon, Christopher Stone:
Towards Exploratory Reformulation of Constraint Models. CoRR abs/2311.11868 (2023) - 2022
- [c9]András Z. Salamon, Michael Wehar:
Superlinear Lower Bounds Based on ETH. STACS 2022: 55:1-55:16 - [i10]Özgür Akgün, Ian P. Gent, Christopher Jefferson, Zeynep Kiziltan, Ian Miguel, Peter Nightingale, András Z. Salamon, Felix Ulrich-Oltean:
Automatic Tabulation in Constraint Models. CoRR abs/2202.13250 (2022) - 2021
- [i9]Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon:
Towards Reformulating Essence Specifications for Robustness. CoRR abs/2111.00821 (2021) - [i8]András Z. Salamon, Michael Wehar:
Effective guessing has unlikely consequences. CoRR abs/2111.02138 (2021) - 2020
- [c8]Özgür Akgün, Nguyen Dang, Ian Miguel, András Z. Salamon, Patrick Spracklen, Christopher Stone:
Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP. CPAIOR 2020: 41-51 - [i7]András Z. Salamon, Michael Wehar:
Stronger Lower Bounds for Polynomial Time Problems. CoRR abs/2008.06805 (2020) - [i6]Özgür Akgün, Nguyen Dang, Joan Espasa, Ian Miguel, András Z. Salamon, Christopher Stone:
Exploring Instance Generation for Automated Planning. CoRR abs/2009.10156 (2020)
2010 – 2019
- 2019
- [c7]Özgür Akgün, Nguyen Dang, Ian Miguel, András Z. Salamon, Christopher Stone:
Instance Generation via Generator Instances. CP 2019: 3-19 - [c6]Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, András Z. Salamon, Josep Suy, Mateu Villaret:
Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. CP 2019: 20-36 - [i5]Özgür Akgün, András Z. Salamon:
Conjure Documentation, Release 2.3.0. CoRR abs/1910.00475 (2019) - 2018
- [c5]Özgür Akgün, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon:
Automatic Discovery and Exploitation of Promising Subproblems for Tabulation. CP 2018: 3-12 - [c4]Özgür Akgün, Saad Attieh, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon, Patrick Spracklen, James Wetter:
A Framework for Constraint Based Local Search using Essence. IJCAI 2018: 1242-1248 - 2015
- [j5]András Z. Salamon:
Transformations of representation in constraint satisfaction. Constraints An Int. J. 20(4): 500-501 (2015) - 2014
- [j4]Egor V. Kostylev, Juan L. Reutter, András Z. Salamon:
Classification of annotation semirings over containment of conjunctive queries. ACM Trans. Database Syst. 39(1): 1:1-1:39 (2014) - 2013
- [b1]András Z. Salamon:
Transformations of representation in constraint satisfaction. University of Oxford, UK, 2013 - 2012
- [j3]David A. Cohen, Martin C. Cooper, Páidí Creed, Dániel Marx, András Z. Salamon:
The Tractability of CSP Classes Defined by Forbidden Patterns. J. Artif. Intell. Res. 45: 47-78 (2012) - [c3]Egor V. Kostylev, Juan L. Reutter, András Z. Salamon:
Classification of annotation semirings over query containment. PODS 2012: 237-248 - [i4]Subramanian Ramamoorthy, András Z. Salamon, Rahul Santhanam:
Macroscopes: models for collective decision making. CoRR abs/1204.3860 (2012) - [i3]András Z. Salamon:
Streaming bounds from difference ramification. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i2]David A. Cohen, Martin C. Cooper, Páidí Creed, András Z. Salamon:
The tractability of CSP classes defined by forbidden patterns. CoRR abs/1103.1542 (2011) - 2010
- [j2]Martin C. Cooper, Peter G. Jeavons, András Z. Salamon:
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination. Artif. Intell. 174(9-10): 570-584 (2010) - [j1]Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron D. Sterling, Suresh Venkatasubramanian:
Questions answered. in theory.: http://cstheory.stackexchange.com/. SIGACT News 41(4): 58-60 (2010)
2000 – 2009
- 2009
- [i1]András Z. Salamon, Vashti Galpin:
Bounds on series-parallel slowdown. CoRR abs/0904.4512 (2009) - 2008
- [c2]András Z. Salamon, Peter G. Jeavons:
Perfect Constraints Are Tractable. CP 2008: 524-528 - [c1]Martin C. Cooper, Peter G. Jeavons, András Z. Salamon:
Hybrid tractable CSPs which generalize tree structure. ECAI 2008: 530-534
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-08-23 19:26 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:
