New Variants of Perfect Non-crossing Matchings

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International Conference on Algorithms and Discrete Applied Mathematics (7. : 2021 : Online) Algorithms and discrete applied mathematics
1. Verfasser:	Mantas, Ioannis (VerfasserIn)
Weitere Verfasser:	Savić, Marko (VerfasserIn), Schrezenmaier, Hendrik (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Online Bin Packing with Overload Cost	2021	Luo, Kelin
New Variants of Perfect Non-crossing Matchings	2021	Mantas, Ioannis
Axiomatic Characterization of the Median Function of a Block Graph	2021	Changat, Manoj
On Coupon Coloring of Cartesian Product of Some Graphs	2021	Francis, P.
Cut Vertex Transit Functions of Hypergraphs	2021	Changat, Manoj
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs	2021	Das, Sandip
Chromatic Bounds for the Subclasses of $$pK_2$$-Free Graphs	2021	Prashant, Athmakoori
Achieving Positive Rates with Predetermined Dictionaries	2021	Ganesan, Ghurumuruhan
Failure and Communication in a Synchronized Multi-drone System	2021	Bereg, Sergey
Approximation Algorithms for Orthogonal Line Centers	2021	Das, Arun Kumar
Burning Grids and Intervals	2021	Gupta, Arya Tanmay
Semitotal Domination on AT-Free Graphs and Circle Graphs	2021	Kloks, Ton
On Parameterized Complexity of Liquid Democracy	2021	Dey, Palash
One-Sided Discrete Terrain Guarding and Chordal Graphs	2021	Prahlad Narasimhan, Kasthurirangan
Cops and Robber on Butterflies and Solid Grids	2021	Akhtar, Sheikh Shakil
On Algorithms to Find p-ordering	2021	Gulati, Aditya
b-Coloring of Some Powers of Hypercubes	2021	Francis, P.
Minimum Consistent Subset of Simple Graph Classes	2021	Dey, Sanjana
On Structural Parameterizations of Load Coloring	2021	Reddy, I. Vinod
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes	2021	Das, Sandip