◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

L. Kowada

12 papers hereh-index 8178 citations60 works total

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

author position
  • first author1
  • middle author9
  • last author2

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

fields
  • cs.DM3
  • cs.DS3
  • quant-ph3
  • math.CO2
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20052026
most citedThe graph tessellation cover number: extremal bounds, efficient algorithms and hardness

8 citations · 19 across the 11 of their papers we have counts for

collaborators
Showing 2019 · cs.CCShow all

1 paper · 2 filters

cs.CC2019

The Tessellation Cover Number of Good Tessellable Graphs

Alexandre Abreu, Luís Cunha, Celina de Figueiredo +4

A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges, and t…

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