Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Philippe Birnbaum

dblp:93/10071 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0003-4830-5500ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 since 2021Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Environmental and earth informatics · 89% Bioinformatics and computational biology · 11%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
constraint programming
0.912025
Towards the 30 by 30 Kunming-Montreal Global Biodiversity Framework Target: Optimising Graph Connectivity in Constraint-Based Spatial Planning · IJCAI 2025
Mathematical optimization
constraint programming
0.412019
Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design · IJCAI 2019
Bioinformatics and computational biology › plant biology
plant species identification
0.112011
Visual-based plant species identification from crowdsourced data · ACM Multimedia 2011
Environmental and earth informatics › conservation
conservation planning
0.112019
Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design · IJCAI 2019
Data mining
crowdsourcing
0.012011
Visual-based plant species identification from crowdsourced data · ACM Multimedia 2011

Methods — techniques the papers use, named apart from their topics

hanan grids · 1.7preprocessing · 0.9pre-processing · 0.9constraint programming · 0.8content-based image retrieval · 0.2
YearPublicationVenuePosition
2025 Towards the 30 by 30 Kunming-Montreal Global Biodiversity Framework Target: Optimising Graph Connectivity in Constraint-Based Spatial Planning
abstract
The Kunming-Montreal Global Biodiversity Framework aims to protect 30% of terrestrial, inland water, marine, and coastal ecosystems worldwide, and ensuring that at least 30% of these areas are under effective restoration by 2030. Maintaining and restoring ecological connectivity between natural habitats and protected areas is a key feature of this target. Achieving it will require effective and inclusive spatial planning supported by appropriate decision-support tools. Most spatial planning models address budget as an objective and connectivity as a constraint, formulating problems with Steiner trees. In many real-world cases, such as landscape-scale restoration planning, this formulation is inappropriate when environmental managers seek to optimise connectivity under a budget constraint. This problem was previously addressed with Constraint Programming (CP) and graph variables, but the current approach is severely limited in terms of spatial resolution. In this article, we formalise this problem as the budget-constrained graph connectivity optimisation problem. Based on a real case study: the restoration of forest connectivity in New Caledonia, we illustrate why ``naive'' CP approaches are inefficient. In response, we provide a preprocessing method based on Hanan grids which preserves the existence of at least one optimal solution. Finally, we assess the efficiency of our approach in the New Caledonian case study.
Sulian Le Bozec-Chiffoleau, Dimitri Justeau-Allaire, Xavier Lorca, Charles Prud'homme, Gilles Simonin, Philippe Vismara, Philippe Birnbaum, Nicolas Rinck, Nicolas Beldiceanu
IJCAI7
2019 Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design
abstract
Faced with natural habitat degradation, fragmentation, and destruction, it is a major challenge for environmental managers to implement sustainable land use policies promoting socioeconomic development and natural habitat conservation in a balanced way. Relying on artificial intelligence and operational research, reserve selection and design models can be of assistance. This paper introduces a partitioning approach based on Constraint Programming (CP) for the reserve selection and design problem, dealing with both coverage and complex spatial constraints. Moreover, it introduces the first CP formulation of the buffer zone constraint, which can be reused to compose more complex spatial constraints. This approach has been evaluated in a real-world dataset addressing the problem of forest fragmentation in New Caledonia, a biodiversity hotspot where managers are gaining interest in integrating these methods into their decisional processes. Through several scenarios, it showed expressiveness, flexibility, and ability to quickly find solutions to complex questions.
Dimitri Justeau-Allaire, Philippe Vismara, Philippe Birnbaum, Xavier Lorca
IJCAI3
2018 Unifying Reserve Design Strategies with Graph Theory and Constraint Programming
Dimitri Justeau-Allaire, Philippe Birnbaum, Xavier Lorca
CP2
2011 Visual-based plant species identification from crowdsourced data
abstract
This demo presents a crowdsourcing web application dedicated to the access of botanical knowledge through automated identification of plant species by visual content. Inspired by citizen sciences, our aim is to speed up the collection and integration of raw botanical observation data, while providing to potential users an easy and efficient access to this botanical knowledge. The result presented during the demo is an enjoying application where anyone can play to shoot fresh cut leaves and observe the relevance of species suggested in spite of various visual difficult queries.
Hervé Goëau, Alexis Joly, Souheil Selmi, Pierre Bonnet, Elise Mouysset, Laurent Joyeux, Jean-François Molino, Philippe Birnbaum, Daniel Barthélémy, Nozha Boujemaa
ACM Multimedia8