Fran\c{c}ois Schwarzentruber

Identifiers

• name variant Fran\c{c}ois Schwarzentruber 0.60 · backfill

Papers (7)

1. Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable cs.LO · 2025 · author #3
2. The Packed Interval Covering Problem is NP-complete cs.CC · 2019 · author #4
3. Reachability Games in Dynamic Epistemic Logic cs.LO · 2019 · author #3
4. Reachability and Coverage Planning for Connected Agents: Extended Version cs.AI · 2019 · author #4
5. Dynamic Connected Cooperative Coverage Problem cs.MA · 2018 · author #2
6. Dynamic Gossip cs.DM · 2015 · author #5
7. DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE cs.LO · 2014 · author #3

Mentions

• 1511.00867 #5 · backfill · confidence 0.70 Fran\c{c}ois Schwarzentruber
• 1411.7825 #3 · backfill · confidence 0.70 Fran\c{c}ois Schwarzentruber

Frequent Coauthors

• Nicolas Troquard 2 shared papers
• Sophie Pinchinat 2 shared papers
• Tristan Charrier 2 shared papers
• Abdallah Saffidine 1 shared papers
• Andreas Herzig 1 shared papers
• Artem Chernobrovkin 1 shared papers
• Arthur Queffelec 1 shared papers
• Bastien Maubert 1 shared papers
• Eva Soulier 1 shared papers
• Hans van Ditmarsch 1 shared papers
• Jan van Eijck 1 shared papers
• Marco S\"alzer 1 shared papers
• Ocan Sankur 1 shared papers
• Pere Pardo 1 shared papers
• Philippe Balbiani 1 shared papers
• Rahim Ramezanian 1 shared papers
• S\'ebastien L\^e Cong 1 shared papers