default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Chiarandini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Alessandra Cenci
, Susanne Jakobsen Ilskov, Nicklas Sindlev Andersen, Marco Chiarandini:
The participatory value-sensitive design (VSD) of a mHealth app targeting citizens with dementia in a Danish municipality. AI Ethics 4(2): 375-401 (2024)- 2022
- [c19]Nicklas Sindlev Andersen, Marco Chiarandini:
Together about Dementia. IJCAI 2022: 5888-5891 - [c18]Erik Andersen, Marco Chiarandini, Marwan Hassani, Stefan Jänicke, Panagiotis Tampakis, Arthur Zimek:
Evaluation of Probability Distribution Distance Metrics in Traffic Flow Outlier Detection. MDM 2022: 64-69 - [c17]Conor McCarthy, Panagiotis Tampakis, Marco Chiarandini, Morten Bredsgaard Randers, Stefan Jänicke, Arthur Zimek:
Analyzing Passing Sequences for the Prediction of Goal-Scoring Opportunities. MLSA@PKDD/ECML 2022: 27-40 - [i3]Nicklas Sindlev Andersen, Marco Chiarandini, Kristian Debrabant:
Dynamic Origin-Destination Matrix Estimation in Urban Traffic Networks. CoRR abs/2202.00099 (2022) - 2021
- [c16]Nicklas Sindlev Andersen, Marco Chiarandini, Jacopo Mauro:
Wandering and getting lost: the architecture of an app activating local communities on dementia issues. SEH@ICSE 2021: 36-43 - [c15]Nicklas Sindlev Andersen, Marco Chiarandini, Stefan Jänicke, Panagiotis Tampakis, Arthur Zimek:
Detecting Wandering Behavior of People with Dementia. ICDM (Workshops) 2021: 727-733 - [c14]Zhiru Sun, Marco Chiarandini:
An Exact Algorithm for Group Formation to Promote Collaborative Learning. LAK 2021: 546-552 - [i2]Nicklas Sindlev Andersen, Marco Chiarandini, Jacopo Mauro:
Wandering and getting lost: the architecture of an app activating local communities on dementia issues. CoRR abs/2103.06777 (2021) - [i1]Nicklas Sindlev Andersen, Marco Chiarandini, Stefan Jänicke, Panagiotis Tampakis, Arthur Zimek:
Detecting Wandering Behavior of People with Dementia. CoRR abs/2110.13128 (2021)
2010 – 2019
- 2019
- [j9]Marco Chiarandini, Rolf Fagerberg, Stefano Gualandi:
Handling preferences in student-project allocation. Ann. Oper. Res. 275(1): 39-78 (2019) - 2018
- [c13]Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen:
Heuristic Variants of A ^* Search for 3D Flight Planning. CPAIOR 2018: 361-376 - [c12]Youcef Djenouri, Arthur Zimek, Marco Chiarandini:
Outlier Detection in Urban Traffic Flow Distributions. ICDM 2018: 935-940 - [p5]Marco Chiarandini, Irina Dumitrescu, Thomas Stützle:
Stochastic Local Search Algorithms for the Graph Colouring Problem. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [c11]Casper Kehlet Jensen, Marco Chiarandini, Kim S. Larsen:
Flight Planning in Free Route Airspaces. ATMOS 2017: 14:1-14:14 - [c10]Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen:
Constraint Handling in Flight Planning. CP 2017: 354-369 - 2016
- [c9]Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen:
Vertical Optimization of Resource Dependent Flight Paths. ECAI 2016: 639-645 - [c8]Anna Bomersbach, Marco Chiarandini, Fabio Vandin:
An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer. WABI 2016: 27-39 - 2014
- [j8]Marco Chiarandini, Niels Hvidberg Kjeldsen, Napoleão Nepomuceno:
Integrated Planning of Biomass Inventory and Energy Production. IEEE Trans. Computers 63(1): 102-114 (2014) - 2012
- [j7]Niels Hvidberg Kjeldsen, Marco Chiarandini:
Heuristic solutions to the long-term unit commitment problem with cogeneration plants. Comput. Oper. Res. 39(2): 269-282 (2012) - [j6]Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi, Andrea Schaerf:
The balanced academic curriculum problem revisited. J. Heuristics 18(1): 119-148 (2012) - 2010
- [j5]Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling:
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Networks 55(4): 299-325 (2010) - [c7]Marco Chiarandini:
Learning Decision Trees for the Analysis of Optimization Heuristics. LION 2010: 208-211 - [c6]Marco Chiarandini, Thomas Stützle:
An Analysis of Heuristics for Vertex Colouring. SEA 2010: 326-337 - [p4]Thomas Bartz-Beielstein, Marco Chiarandini, Luís Paquete, Mike Preuss:
Introduction. Experimental Methods for the Analysis of Optimization Algorithms 2010: 1-13 - [p3]Marco Chiarandini, Yuri Goegebeur:
Mixed Models for the Analysis of Optimization Algorithms. Experimental Methods for the Analysis of Optimization Algorithms 2010: 225-264 - [e1]Thomas Bartz-Beielstein, Marco Chiarandini, Luís Paquete, Mike Preuss:
Experimental Methods for the Analysis of Optimization Algorithms. Springer 2010, ISBN 978-3-642-02537-2 [contents]
2000 – 2009
- 2008
- [j4]Marco Chiarandini, Ilias S. Kotsireas, Christos Koukouvinos, Luís Paquete:
Heuristic algorithms for Hadamard matrices with two circulant cores. Theor. Comput. Sci. 407(1-3): 274-277 (2008) - [p2]Marco Chiarandini, Irina Dumitrescu, Thomas Stützle:
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems. Hybrid Metaheuristics 2008: 117-150 - 2007
- [j3]Marco Chiarandini, Thomas Stützle:
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment. Constraints An Int. J. 12(3): 371-403 (2007) - [c5]Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen:
Mixed Models for the Analysis of Local Search Components. SLS 2007: 91-105 - [r1]Thomas Stützle, Irina Dumitrescu, Marco Chiarandini:
Stochastic Local Search Algorithms for the Graph Coloring Problem. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j2]Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto:
Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. J. Math. Model. Algorithms 5(1): 91-110 (2006) - [j1]Marco Chiarandini, Mauro Birattari, Krzysztof Socha, Olivia Rossi-Doria:
An effective hybrid algorithm for university course timetabling. J. Sched. 9(5): 403-432 (2006) - [c4]Luca Di Gaspero, Marco Chiarandini, Andrea Schaerf:
A Study on the Short-Term Prohibition Mechanisms in Tabu Search. ECAI 2006: 83-87 - [c3]Marco Chiarandini, Thomas Stützle, Kim S. Larsen:
Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem. Hybrid Metaheuristics 2006: 162-177 - 2005
- [b1]Marco Chiarandini:
Stochastic local search methods for highly constrained combinatorial optimisation problems: graph colouring, generalisations, and applications. Darmstadt University of Technology, Germany, 2005, pp. 1-320 - 2004
- [c2]Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto:
Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. PPSN 2004: 450-460 - [p1]Luís Paquete, Marco Chiarandini, Thomas Stützle:
Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study. Metaheuristics for Multiobjective Optimisation 2004: 177-199 - 2002
- [c1]Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luís Paquete, Thomas Stützle:
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. PATAT 2002: 329-354
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-07 22:14 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:
