◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Arman Boyaci

6 papers hereh-index 446 citations15 works total

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

author position
  • first author6

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

fields
  • cs.DM4
  • cs.DS2

identity via Semantic Scholar / OpenAlex

activity
20132020
most citedGraphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I

3 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing 2015 · cs.DSShow all

1 paper · 2 filters

cs.DS2015

The Maximum Cut Problem in Co-bipartite Chain Graphs

Arman Boyacı, Tınaz Ekim, Mordechai Shalom

A \emph{co-bipartite chain} graph is a co-bipartite graph in which the neighborhoods of the vertices in each clique can be linearly ordered with respect to inclusion. It is known 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.