yusuke1997/dblp-id-title huggingface dataset:
Bicyclic graphs with extremal values of PI index
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
Integer Programming in VLSI Design
The connectivity of a graph and its complement
A note on S-packing colorings of lattices
Distributed One-Pass Online AUC Maximization
On a problem related to the Vandermonde determinant
Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing
A correspondence between scene analysis and motions of frameworks
Minimum degree, independence number and pseudo [2, b]-factors in graphs
On hyper-Hamiltonicity in graphs
The generalized position values for communication games with coalition configuration
Using transforming matrices to generate DNA clone grids
Remarks on the upper bound for the Randić energy of bipartite graphs
Bounds on Kemeny's constant of trees with a prescribed matching number
Facet defining inequalities among graph invariants: The system GraPHedron
On the largest matching roots of graphs with a given number of pendent vertices
Epidemiography with various growth functions
On the chromatic number of random subgraphs of a certain distance graph
Efficient methods of constructing universal cycles for k-permutations
New Methods for Using Cayley Graphs in Interconnection Networks
The complexity of spanning tree problems involving graphical indices
Cycles in the burnt pancake graph
List signature schemes
Matchings in graphs with a given number of cuts
On the number of edges in the transitive closure of a graph
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square
Preface: WEPA 2018
A note on the connected game coloring number
The Newton Bracketing method for the minimization of convex functions subject to affine constraints
An explicit class of codes with good parameters and their duals
On optimal strategies for a betting game
Restricted non-separable planar maps and some pattern avoiding permutations
Multi-word-representability of graphs
Proof of a conjecture on Wiener index and eccentricity of a graph due to edge contraction
The parametric complexity of graph diameter augmentation
Linear Broadcast Encryption Schemes
Partitioning P4-tidy graphs into a stable set and a forest
Sum index and difference index of graphs
Boole's Conditions of Possible Experience and Reasoning under Uncertainty
Fast computation of Andrews' smallest part statistic and conjectured congruences
On b-greedy colourings and z-colourings
Majority and plurality problems
Near optimal colourability on (H, Kn-e)-free graphs
An infinite sequence of non-realizable weavings
Broadcasting on [0, L]
Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
On the number of perfect matchings of line graphs
Parallel machine scheduling with a common server
Embedding K3,3 and K5 on the double torus
Systems of sets such that each set properly intersects at most one other set - Application to cluster analysis
A min-max relation in flowgraphs and some applications
Security in graphs
Link dimension and exact construction of graphs from distance vectors
Decomposing clique search problems into smaller instances based on node and edge colorings
Principal structures of submodular systems
Relationship between superstring and compression measures: New insights on the greedy conjecture
Construction and enumeration of correlation immune rotation symmetric Boolean functions
Polynomial-time algorithms for minimum weighted colorings of ()-free graphs and similar graph classes
On the suppression of variables in Boolean equations
On subclasses of interval count two and on Fishburn's conjecture
Letter graphs and modular decomposition
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
Rotator design
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
On the partition dimension of trees
Reliability analysis of godan graphs in terms of generalized 4-connectivity
Squares and primitivity in partial words
The distribution of cycles in breakpoint graphs of signed permutations
A Generalization of the Stable Matching Problem
Decompositions into Linear Forests and Difference Labelings of Graphs
C-differential bent functions and perfect nonlinearity
Kernelization for cycle transversal problems
The Parallel Complexity of Single Rule Logic Programs
On oriented cliques with respect to push operation
On shortest three-edge-connected Steiner networks with Euclidean distance
Bichain graphs: Geometric model and universal graphs
Algorithms for graphs with small octopus
Mathematical crystal growth II
L(2, 1)-labelling of generalized prisms
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
Robust similarity between hypergraphs based on valuations and mathematical morphology operators
A tree distinguishing polynomial
Algorithmic results for weak Roman domination problem in graphs
The outerplanar crossing number of the complete bipartite graph
Bounds on Kemeny's constant of a graph and the Nordhaus-Gaddum problem
Distance spectral radius of trees with given matching number
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
On connectivities of edge-colored graphs
On the minimum local-vertex-connectivity augmentation in graphs
Scheduling coupled-operation jobs with exact time-lags
Paired domination on interval and circular-arc graphs
Relations between gene regulatory networks and cell dynamics in Boolean models
Coloring of (P6,dart, K4)-free graphs
On upper bounds for the independent transversal domination number
Tight Bounds for Synchronous Communication of Information Using Bits, Silence
The number of steps and the final configuration of relaxation procedures on graphs
Ordered binary decision diagrams and the Shannon effect
Packing two copies of a tree into a bipartite graph with restrained maximum degree
A solvable case of image reconstruction in discrete tomography
Dynamic faults have small effect on broadcasting in hypercubes
Characterization of the deletion of (26, 6)-simple points as multivalued (N, 26)-retractions
Egan conjecture holds
Resistance distances and the Kirchhoff index in Cayley graphs
Notes on de Bruijn sequences
Perfect domination sets in Cayley graphs
The Multi-SAT Algorithm
Addendum to the threshold order of a Boolean function
A compact labeling scheme for series-parallel graphs
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
PTASs for secure dominating set in planar graphs and growth-bounded graphs
Dynamic coloring of IC-planar graphs
New lower bounds for the first variable Zagreb index
Isometric Hamming embeddings of weighted graphs
Inverting graphs of rectangular matrices
Characterization of curve map graphs
A new upper bound on the total domination number in graphs with minimum degree six
The linear 2-arboricity of IC-planar graphs
Phylogenetic graph models beyond trees
Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence
Worst-case efficient dominating sets in digraphs
Bounds for zero forcing numbers of connected graphs with fixed order and maximum degree
A branch-and-price algorithm for the robust graph coloring problem
On the eigenvalues of eccentricity matrix of graphs
On the sizes of graphs and their powers: The undirected case
Polygonal estimation of planar convex-set perimeter from its two projections
On two open problems on the normality of bent functions
Large Planar Graphs with Given Diameter and Maximum Degree
More fires and more fighters
Bounds for isoperimetric constants of infinite plane graphs
Dense Group Networks
Packing bipartite graphs with covers of complete bipartite graphs
Excluded-minor characterizations of antimatroids arisen from posets and graph searches
k -th order symmetric SAC boolean functions and bisecting binomial coefficients
A cutting plane algorithm for graph coloring
The pessimistic diagnosability of three kinds of graphs
Packing chromatic number of distance graphs
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
On variants of Vertex Geography on undirected graphs
A survey-based approach for designing the lines of a rapid transit network
Graphs of f-class 1
Some Concepts of Stability Analysis in Combinatorial optimization
Distributed Processing of Divisible Jobs with Communication Startup Costs
Finding a minimum independent dominating set in a permutation graph
Decomposing weighted digraphs into sums of chains
Resonant patterns in boron-nitrogen fullerenes
Exploiting partial knowledge of satisfying assignments
The Maximal Clique and Colourability of Curve Contact Graphs
A branch-and-bound approach to the no-idle flowshop scheduling problem
Adding activities to the dual instead of cuts to the primal problem
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability
The degree sequence of the preferential attachment model
Compositional complexity of Boolean functions
Hamiltonicity of a Type of Interchange Graphs
On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision
Primitive partial words
A polynomial algorithm for convex quadratic optimization subject to linear inequalities
The size of graphs with given feedback vertex number
The 6-degeneracy of 1-planar graphs
k-circular matroids of graphs
On the generalized Helly property of hypergraphs, cliques, and bicliques
Finding Hamiltonian circuits in quasi-adjoint graphs
The smallest nontrivial snarks of oddness 4
Distance spectral radius and edge-disjoint spanning trees
On the robustness of primitive words
Partitioning vertices of graphs into paths of the same length
A Fast Parallel Algorithm to Recognize P4-sparse Graphs
Set and size multipartite Ramsey numbers for stars
On the game coloring index of -decomposable graphs
On the termination of some biclique operators on multipartite graphs
A Transfinite Form of Sibson's Interpolant
On the complexity of rainbow coloring problems
Minimum k-critical bipartite graphs
On the computational complexity of closest genome problems
A convoy scheduling problem
Digital pseudomanifolds, digital weakmanifolds and Jordan-Brouwer separation theorem
Optimal Sequential Inspections of Reliability Systems Subject to Parallel-chain Precedence Constraints
An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem
Expected polynomial-time randomized algorithm for graph coloring problem
A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines
A family of Hadamard matrices of dihedral group type
Dividing and Conquering the Square
Some new results concerning power graphs and enhanced power graphs of groups
A recursive formula for weights of Boolean rotation symmetric functions
Chinese Postman Problem on edge-colored multigraphs
Bounded Depth Broadcasting
Some bounds on the zero forcing number of a graph
Domination of maximal K 4 -minor free graphs and maximal K 2, 3 -minor free graphs, and disproofs of two conjectures on planar graphs
Laminar structure of ptolemaic graphs with applications
On strongly regular signed graphs
Simple Reductions Between D 0 L Language and Sequence Equivalence Problems
Neighbor connectivity of undirected toroidal meshes
Expected Value Expansions in Rooted Graphs
Covering and radius-covering arrays: Constructions and classification
Feature controlled adaptive difference operators
Recursive constructions of N-polynomials over GF(2 s )
Induced star partition of graphs
The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs
Nordhaus-Gaddum problems for power domination
On strong edge-coloring of graphs with maximum degree 5
Compositions for Matroids with the Fulkerson Property
L(2, 1)-labeling of disk intersection graphs
An exact algorithm for maximum independent set in degree-5 graphs
Ambiguity and deficiency for differentially -uniform monomial permutations on
A Group Testing Problem for Hypergraphs of Bounded Rank
Combinatorial properties of the family of maximum stable sets of a graph
Optimising sum-of-squares measures for clustering multisets defined over a metric space
On semidefinite least squares and minimal unsatisfiability
Edge Ranking of Graphs Is Hard
Some spectral inequalities for connected bipartite graphs with maximum Aα-index
Every planar graph is 1-defective (9, 2)-paintable
(1,1)-Cluster Editing is polynomial-time solvable
On column generation formulations for the RWA problem
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
Scheduling one batch processor subject to job release dates
On conjectures of network distance measures by using graph spectra
Limit points of spectra for first-order properties of random hypergraphs
Minimizing makespan with release times on identical parallel batching machines
On the linear (n-1)-arboricity of K n(m)
On the Directionality of Interval Orders
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
Representative graphs of r-regular partial planes and representation of orthomodular posets
Total outer-connected domination numbers of trees
On the number of maximal independent sets in minimum colorings of split graphs
Equitable factorizations of edge-connected graphs
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
Local transformations of graphs preserving independence number
Determining the L (2, 1)L(2, 1)-span in polynomial space
Fixed-parameter algorithms for DAG Partitioning
Positive existential definability in finite structures
Emerging applications, models and algorithms in combinatorial optimization
On the covering radius of long binary BCH codes
Word-representability of split graphs generated by morphisms
Coloring (P5, kite)-free graphs with small cliques
On the Bruhat order of labeled graphs
Ray shooting from convex ranges
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
Strong edge-coloring of 2-degenerate graphs
Upper bounds on the average eccentricity
Toughness and binding number
Grünbaum colorings of triangulations on the projective plane
The reliability analysis based on the generalized connectivity in balanced hypercubes
Cayley graphs of diameter two and any degree with order half of the Moore bound
Small cutsets in arc-transitive digraphs of prime degree
On the longest path of a randomly weighted tournament
The second largest eigenvalue and vertex-connectivity of regular multigraphs
Streaming algorithms for multitasking scheduling with shared processing
Axiomatic characterization of the center function. The case of non-universal axioms
Optimal key systems
Sparsest cuts and concurrent flows in product graphs
Synthetic description of a semiorder
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Factors of bipartite graphs with degree conditions imposed on each partite set
Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]
On the generation of convex polyominoes
The k-ball l-path Branch Weight Centroid
Supereulerian graphs with width s and s-collapsible graphs
Finite isomorphically complete systems
Minimum multiplicity edge coloring via orientation
Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
Phylogeny numbers for graphs with two triangles
Functional Dependencies in Relational Databases: A Lattice Point of View
Strong products of hypergraphs: Unique prime factorization theorems and algorithms
Parameterized algorithms for Module Map problems
Vertex coloring of graphs with few obstructions
On some conditioning results in the probabilistic analysis of algorithms
Grammars and clique-width bounds from split decompositions
On an infinite sequence of improving Boolean bases
on the Structure of Trapezoid Graphs
First order non-definability of some transit functions on graphs
An NP-complete matching problem
Diagnosis of constant faults in iteration-free circuits over monotone basis
Notes on discrepancy and anti-discrepancy in oriented graphs
Lower bounds for recognizing small cliques on CRCW PRAM's
A Markov chain on the solution space of edge colorings of bipartite graphs
The complexity of minimum convex coloring
Approximation schemes for parallel machine scheduling with availability constraints
A note on the diameter of convex polytope
On Domination Numbers of Cartesian Product of Paths
Preface: Graph theory and combinatorics
On the domination number of permutation graphs and an application to strong fixed points
A 2 2/3 Superstring Approximation Algorithm
A comparison of lower bounds for the symmetric circulant traveling salesman problem
Edge contraction and edge removal on iterated clique graphs
On partial Grundy coloring of bipartite graphs and chordal graphs
On 3-y t -vertex critical graphs of diameter three
On the membership problem for regular DNLC grammars
A note on bounds for the broadcast domination number of graphs
Stochastic applications of media theory: Random walks on weak orders or partial orders
Complete solution of equation W(L 3 (T))=W(T) for the Wiener index of iterated line graphs of trees
Constructive characterizations concerning weak Roman domination in trees
Query complexity of Boolean functions on the middle slice of the cube
Signed Roman k-domination in trees
Chordality and 2-factors in Tough Graphs
Approximation of the parallel machine scheduling problem with additional unit resources
Many-to-many two-disjoint path covers in cylindrical and toroidal grids
Computing square roots of trivially perfect and threshold graphs
Bounds for the chromatic number of some pK2-free graphs
A Unified Approximation Algorithm for Node-deletion Problems
Coloring graphs without short cycles and long induced paths
O(1) query time algorithm for all pairs shortest distances on permutation graphs
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints
On the dualization in distributive lattices and related problems
Hardness and approximation results for some variants of Stable Marriage problem
A characterization of graphs with given total coalition numbers
Recognizing pseudo-median graphs
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
Vertex-critical (P5,chair)-free graphs
On the choice of explicit stabilizing terms in column generation
Toughness and prism-hamiltonicity of P4-free graphs
On the approximability and exact algorithms for vector domination and related problems in graphs
Existence of directedwhist tournaments with the three person property 3PDWh(v)
Excluding cycles with a fixed number of chords
Independence and domination in Polygon Graphs
Group distance magic labeling of tetravalent circulant graphs
On homogeneous rotation symmetric bent functions
Computing the P3-hull number of a graph, a polyhedral approach
On approximating the Incremental Knapsack Problem
New bounds on the double domination number of trees
The minimum spanning strong subdigraph problem is fixed parameter tractable
Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
Optimal on-line flow time with resource augmentation
The vertex leafage of chordal graphs
Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
Maximum weight independent set for ℓclaw-free graphs in polynomial time
Scheduling and constraint propagation
Properties of optimal schedules in preemptive shop scheduling
Resource allocation under limited sharing
Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
On 3-component domination numbers in graphs
Approximate location of relevant variables under the crossover distribution
Boundary value problems on weighted networks
On the convergence of generalized hill climbing algorithms
On the order of the largest induced tree in a random graph
On strong proper connection number of cubic graphs
On a Generalization of Extended Resolution
Characterization of the Jaccard dissimilarity metric and a generalization
Matroid representation of clique complexes
Stack words and a bound for 3-stack sortable permutations
Boolean functions with a simple certificate for CNF complexity
-equitable b-coloring of graphs
Power domination on permutation graphs
A new general family of mixed graphs
The signed Roman k-domatic number of a graph
Interacting dimers on a Sierpinski gasket
Inner-core and Outer-core Functions of Partially Defined Boolean Functions
Constructing formally self-dual codes over R k
An approximation algorithm for the maximum cut problem and its experimental analysis
On the Quality of Local Search for the Quadratic Assignment Problem
Edge-packing Planar Graphs by Cyclic Graphs
Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees
K1, 2-isolation in graphs
Streaming algorithms for robust submodular maximization
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs
Anti-Ramsey threshold of cycles
Non-trivial t-intersecting separated families
Comparison of Permanental Bounds of (0, 1)-matrices
On the contour of graphs
Improving deduplication techniques by accelerating remainder calculations
A characterization of the resonance graph of an outerplane bipartite graph
A characterization of nested canalyzing functions with maximum average sensitivity
Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
On the subgraph epimorphism problem
Many-to-many matching with max-min preferences
Sphericity, cubicity, and edge clique covers of graphs
On star edge colorings of bipartite and subcubic graphs
Extremal problems on distance spectra of graphs
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
Large convex cones in hypercubes
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs
Global defensive alliances of trees and Cartesian product of paths and cycles
Random walks and Laplacians on hypergraphs: When do they match?
On Aggregating Two Linear Diophantine Equations
On semi-transitivity of (extended) Mycielski graphs
A New Algorithm for the Propositional Satisfiability Problem
Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures
Dominating and irredundant broadcasts in graphs
On classes of minimal circular-imperfect graphs
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
The minimum second Zagreb eccentricity index of graphs with parameters
Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference
The Nonexistence of Reduction Rules Giving an Embedding into a K-tree
Complexity and computation of connected zero forcing
The complexity of register allocation
On the Double Competition Number
Another look at graph coloring via propositional satisfiability
Star-critical Ramsey numbers of trees versus wheels
Combinatorial and asymptotic results on the neighborhood grid
On a Diagonal Conjecture for classical Ramsey numbers
On self-dual double negacirculant codes
The resolution complexity of random graph k -colorability
Color-avoiding connected spanning subgraphs with minimum number of edges
Restrained Roman and restrained Italian domatic numbers of graphs
The circuit polynomial of the restricted rooted product G(Gamma) of graphs with a bipartite core G
Discrete convexity: convexity for functions defined on discrete spaces
A note on a directed version of the 1-2-3 Conjecture