◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jingjin Yu

Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, NJ, USA

37 papers hereh-index 273.1k citations82 works total

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

author position
  • sole author5
  • first author12
  • middle author4
  • last author16

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

fields
  • cs.RO29
  • cs.DS3
  • cs.CG1
  • cs.MA1
  • cs.NI1
  • eess.SY1
affiliations
  • Department of Computer Science, Rutgers, The State University of New Jersey, Piscataway, NJ, USA
HomepageORCID 0000-0003-4112-2250
same name
  • Jingjin Yu — 27 papers, h 13
  • Jingjin Yu — 7 papers, h 2
  • Jingjin Yu — 3 papers, h 1
  • Jingjin Yu — 2 papers, h 2
  • Jingjin Yu — 2 papers, h 1
  • Jingjin Yu — 2 papers, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20122023
most citedOptimal Multi-Robot Path Planning on Graphs: Structure and Computational Complexity

33 citations · 215 across the 36 of their papers we have counts for

collaborators
Showing cs.DSShow all

3 papers · 1 filter

cs.DS2013★ 12 cited

A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs

Jingjin Yu

Given a connected, undirected, simple graph G=(V,E) and p≤∣V∣ pebbles labeled 1,...,p, a configuration of these p pebbles is an injective map assigning the pebbles…

cs.DS2012★ 1 cited

Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms

Jingjin Yu, Daniela Rus

We study the problem of planning paths for p distinguishable pebbles (robots) residing on the vertices of an n-vertex connected graph with p≤n. A pebble may move from a v…

cs.DS2012★ 27 cited

Multi-agent Path Planning and Network Flow

Jingjin Yu, Steven M. LaValle

This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the latter, therefore enabling the applicatio…

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