◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jie Ma

5 papers hereh-index 350 citations7 works total

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

author position
  • middle author4
  • last author1

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

fields
  • math.CO4
  • cs.CV1
same name
  • Jie Ma — 50 papers, h 16
  • Jie Ma — 19 papers, h 8
  • Jie Ma — 16 papers, h 15
  • Jie Ma — 15 papers, h 30
  • Jie Ma — 11 papers, h 18
  • Jie Ma — 11 papers, h 9

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
20222026
collaborators

5 papers

math.CO2026

A note on the Ratio and Inertia Bounds for the k-Independence Number

Jun Gao, Jie Ma, Oleg Pikhurko

The k-th power Gk of a graph G is the graph on the same vertex set where the edge set consists of those pairs of distinct vertices of G that are at distance at most k fr…

cs.CV2026

SkyShield: Occupancy as a Safety Interface for Low-Altitude UAV Autonomy

Jie Gao, Jie Ma, Kaihui Lin +4

For low-altitude Unmanned Aerial Vehicle (UAV) autonomy, 3D spatial understanding is not merely a perception objective, but the safety interface between human instructions and phys…

math.CO2024

Phase transition of degenerate Turán problems in p-norms

Jun Gao, Xizhi Liu, Jie Ma +1

For a positive real number p, the p-norm ∥G∥p​ of a graph G is the sum of the p-th powers of all vertex degrees. We study the maximum p-norm $\ma…

math.CO2022

On two cycles of consecutive even lengths

Jun Gao, Binlong Li, Jie Ma +1

Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart…

math.CO2022

Tight bounds towards a conjecture of Gallai

Jun Gao, Jie Ma

We prove that for n>k≥3, if G is an n-vertex graph with chromatic number k but any its proper subgraph has smaller chromatic number, then G contains at most n−k+3 c…

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