Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi' an, China, July 29–31, 2019, Proceedings > Matching Cut in Graphs with Large Minimum Degree
Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi' an, China, July 29–31, 2019, Proceedings |
Ding-Zhu Du; Zhenhua Duan; Cong Tian
Springer International Publishing
Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi' an, China, July 29–31, 2019, Proceedings
Matching Cut in Graphs with Large Minimum Degree
Authors

Sun-Yuan Hsieh; Hoang-Oanh Le; Van Bang Le; Sheng-Lung Peng

ARI Id

1665204135583_5350555

Access

Not Available Free

Pages

301-312

DOI

10.1007/978-3-030-26176-4_25

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-030-26176-4_25

Table of Contents of Book
Showing 1 to 20 of 57 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
i-xiii
Fully Dynamic Arboricity Maintenance
Niranka Banerjee; Venkatesh Raman; Saket Saurabh
1-12
A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice
Gill Barequet; Minati De
13-24
An FPTAS for a General Class of Parametric Optimization Problems
Cristina Bazgan; Arne Herzel; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten
25-37
Geodesic Fault-Tolerant Additive Weighted Spanners
Sukanya Bhattacharjee; R. Inkulu
38-51
Diameter of Colorings Under Kempe Changes
Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta; Moritz Mühlenthaler et al.
52-64
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line
Dibyayan Chakraborty; Sandip Das; Joydeep Mukherjee
65-77
Minimizing the Cost of Batch Calibrations
Vincent Chau; Minming Li; Yinling Wang; Ruilong Zhang; Yingchao Zhao
78-89
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes
Prasad Chaugule; Nutan Limaye; Aditya Varre
90-102
Chance-Constrained Submodular Knapsack Problem
Junjie Chen; Takanori Maehara
103-114
Approximation Hardness of Travelling Salesman via Weighted Amplifiers
Miroslav Chlebík; Janka Chlebíková
115-127
Deleting to Structured Trees
Pratyush Dayal; Neeldhara Misra
128-139
Sensitivity, Affine Transforms and Quantum Communication Complexity
Krishnamoorthy Dinesh; Jayalal Sarma
140-152
On Exactly Learning Disjunctions and DNFs Without Equivalence Queries
Ning Ding
153-165
Interactive Physical Zero-Knowledge Proof for Norinori
Jean-Guillaume Dumas; Pascal Lafourcade; Daiki Miyahara; Takaaki Mizuki; Tatsuya Sasaki; Hideaki Sone
166-177
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
Purnata Ghosal; B. V. Raghavendra Rao
178-192
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties
Kavitha Gopal; Meghana Nasre; Prajakta Nimbhorkar; T. Pradeep Reddy
193-205
Feasibility Algorithms for the Duplication-Loss Cost
Paweł Górecki; Alexey Markin; Oliver Eulenstein
206-218
Imbalance, Cutwidth, and the Structure of Optimal Orderings
Jan Gorzny; Jonathan F. Buss
219-231
Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs
Grzegorz Guśpiel
232-239
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 57 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings