◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sibel Ozkan

7 papers hereh-index 7144 citations23 works total

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

author position
  • middle author2
  • last author5

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

fields
  • math.CO5
  • cs.DM1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20152025
most citedOn the Hamilton-Waterloo Problem with triangle factors and C3x​-factors

14 citations · 14 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2016

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

Didem Gözüpek, Sibel Özkan, Christophe Paul +2

In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The "Minimum Chan…

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