Research Output per year

## Fingerprint Fingerprint is based on mining the text of the expert's scholarly documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

- 4 Similar Profiles

Polynomials
Engineering & Materials Science

Directed graphs
Engineering & Materials Science

Graph in graph theory
Mathematics

Approximation algorithms
Engineering & Materials Science

Deterministic Algorithm
Mathematics

Vertex of a graph
Mathematics

Unstable
Mathematics

Game theory
Engineering & Materials Science

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 2008 2019

## Additive stabilizers for unstable graphs

Chandrasekaran, K., Gottschalk, C., Könemann, J., Peis, B., Schmand, D. & Wierz, A., Feb 2019, In : Discrete Optimization. 31, p. 56-78 23 p.Research output: Contribution to journal › Article

Unstable

Stabilization

Graph in graph theory

Hardness

Polynomials

## A tight √2 -approximation for linear 3-cut

Bérczi, K., Chandrasekaran, K., Király, T. & Madan, V., Jan 1 2019, In : Mathematical Programming.Research output: Contribution to journal › Article

Directed graphs

Directed Graph

Approximability

Approximation

Vertex of a graph

## Hypergraph k-cut in randomized polynomial time

Chandrasekaran, K., Xu, C. & Yu, X., Jan 1 2019, (Accepted/In press) In : Mathematical Programming.Research output: Contribution to journal › Article

Hypergraph

Polynomial time

Polynomials

Connected Components

Contraction

## Improving the Integrality Gap for Multiway Cut

Bérczi, KF., Chandrasekaran, K., Király, TE. & Madan, V., Jan 1 2019,*Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings.*Nagarajan, V. & Lodi, A. (eds.). Springer-Verlag, p. 115-127 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11480 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Multiway Cut

Integrality

Labeling

Partition

Inapproximability

## Improving the smoothed complexity of FLIP for max cut problems

Bibak, A., Carlson, C. & Chandrasekaran, K., Jan 1 2019, p. 897-916. 20 p.Research output: Contribution to conference › Paper

Max-cut Problem

Polynomials

Max-cut

Complete Graph

Polynomial