◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Léon Planken

2 papers hereh-index 8254 citations12 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.AI1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

most citedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth

55 citations · 55 across the 2 of their papers we have counts for

collaborators

2 papers

cs.AI2024

Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags

Kim van den Houten, Léon Planken, Esteban Freydell +2

This study investigates scheduling strategies for the stochastic resource-constrained project scheduling problem with maximal time lags (SRCPSP/max)). Recent advances in Constraint…

cs.DS2014★ 55 cited

Computing All-Pairs Shortest Paths by Leveraging Low Treewidth

Léon R. Planken, Mathijs M. de Weerdt, Roman P. J. van der Krogt

We present two new and efficient algorithms for computing all-pairs shortest paths. The algorithms operate on directed graphs with real (possibly negative) weights. They make use o…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.