◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Thomas Kalinowski

2 papers here

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

author position
  • first author1
  • last author1

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

fields
  • cs.DM2
ORCID 0000-0002-8444-6848
same name
  • Thomas Kalinowski — 1 paper, 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

most citedIncremental Network Design with Maximum Flows

53 citations · 54 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DM2016★ 1 cited

H-supermagic labelings for firecrackers, banana trees and flowers

Rachel Wulan Nirmalasari Wijaya, Andrea Semaničová-Feňovčíková, Joe Ryan +1

A simple graph G=(V,E) admits an H-covering if every edge in E is contained in a subgraph H′=(V′,E′) of G which is isomorphic to H. In this case we say that G is H-…

cs.DM2013★ 53 cited

Incremental Network Design with Maximum Flows

Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh

We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where…

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