Jon-Lark Kim (김종락), Introduction to Boolean functions with Artificial Neural Network
Room B232 IBS (기초과학연구원)A Boolean function is a function from the set Q of binary vectors of length n (i.e., the binary n-dimensional hypercube) to
10 events found.
Rose McCarty, Circle graphs are polynomially chi-bounded
Room B232 IBS (기초과학연구원)Circle graphs are the intersection graphs of chords on a circle; vertices correspond to chords, and two vertices are adjacent if their chords intersect. We prove that every circle graph with clique number k has chromatic number at most
Sang June Lee (이상준), On strong Sidon sets of integers
Room B232 IBS (기초과학연구원)Let
Xin Zhang (张欣), On equitable tree-colorings of graphs
Room B232 IBS (기초과학연구원)An equitable tree-
Lars Jaffke, A complexity dichotomy for critical values of the b-chromatic number of graphs
Room B232 IBS (기초과학연구원)A
Jinyoung Park (박진영), The number of maximal independent sets in the Hamming cube
Room B232 IBS (기초과학연구원)Let
Suil O (오수일), An odd [1,b]-factor in regular graphs from eigenvalues
Room B232 IBS (기초과학연구원)An odd $$-factor of a graph is a spanning subgraph
Patrice Ossona de Mendez, A model theoretical approach to sparsity
Room B232 IBS (기초과학연구원)We discuss how the model theoretic notion of first-order transduction allows to define a notion of structural sparsity, and give some example of applications, like existence of low shrub-depth decompositions for tranductions of bounded expansion classes, characterization of transductions of classes with bounded pathwidth, decompositions of graphs with bounded rank-width into cographs.
Dabeen Lee (이다빈), Integrality of set covering polyhedra and clutter minors
Room B232 IBS (기초과학연구원)Given a finite set of elements
2019 IBS Summer Research Program on Algorithms and Complexity in Discrete Structures
Room B232 IBS (기초과학연구원)Schedule July 22 Monday 10:00-11:00 Introduction, 11:00-12:00 Open Problems July 23 Tuesday 10:00-10:30 Stefan Kratsch, Humboldt-Universität zu Berlin, Germany Elimination Distances, Blocking Sets, and Kernels for Vertex Cover 10:45-11:15 Benjamin Bergougnoux, University Clermont Auvergne, France More applications of the d-neighbor equivalence 11:30-12:00 Yixin Cao, Hong Kong Polytechnic University, China Enumerating Maximal Induced Subgraphs 13:30-14:30 Open Problems …