◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Kittiphon Phalakarn

8 papers hereh-index 327 citations14 works total

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

author position
  • first author6
  • middle author2

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

fields
  • cs.LO2
  • cs.AR1
  • cs.DM1
  • cs.DS1
  • cs.FL1
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20202026
most citedWidest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games

9 citations · 12 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

A Coalgebraic Dijkstra Algorithm

Takahiro Sanada, Yoàv Montacute, Kittiphon Phalakarn +1

The Dijkstra algorithm is a classical method for solving the shortest path problem on weighted graphs. There are several variations of the Dijkstra algorithm, including algorithms…

◍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.