yusuke1997/dblp-id-title huggingface dataset:
Implementing generating functions to obtain power indices with coalition configuration
On forcibly k-connected and forcibly k-arc-connected digraphic sequences
Reduction of Symmetric Configurations n 3
χ-boundedness and related problems on graphs without long induced paths: A survey
A coordinate ascent approach to tomographic reconstruction of label images from a few projections
On the approximation of minimum cost homomorphism to bipartite graphs
Extremal spectral radius of graphs with cyclic edge-connectivity
Power domination in regular claw-free graphs
Wiener Number of Vertex-weighted Graphs and a Chemical Application
A flexible model and efficient solution strategies for discrete location problems
On the hyperbolicity of bipartite graphs and intersection graphs
A lower bound on the order of the largest induced forest in planar graphs with high girth
Eccentricity sums in trees
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
Partitioning graphs into induced subgraphs
Upper bounds on ATSP neighborhood size
Parallel algorithms for separable permutations
Minmax subtree cover problem on cacti
Extremal problems for connected set enumeration
A tight lower bound for Vertex Planarization on graphs of bounded treewidth
Safe set problem on graphs
Pagoda functions for peg solitaire on graphs
Axiomatic characterization of the median and antimedian function on a complete graph minus a matching
On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs
The optimal way to play the most difficult repeated two-player coordination games
A characterization of line graphs that are squares of graphs
Anticoloring of the rook's graph
Some results on Lagrangians of hypergraphs
Error-correcting pooling designs associated with some distance-regular graphs
An O(mlog logD) algorithm for shortest paths
A forbidden subgraph characterization of line-polar bipartite graphs
Multilevel secret sharing schemes arising from the normal rational curve
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
Selecting the k largest elements with parity tests
Independent sets in Line of Sight networks
Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs - A survey
Intersection models of weakly chordal graphs
On compact and efficient routing in certain graph classes
Inverse optimization problems with multiple weight functions
Hypergraphs with large domination number and with edge sizes at least three
Complete characterization of the minimal-ABC trees
Dense induced bipartite subgraphs in H -free graphs
Recognition problems and communication complexity
Multiway cuts with a choice of representatives
Timber game as a counting problem
Feasibility Pump-like heuristics for mixed integer problems
EP Theorems and Linear Complementarity Problems
A hybrid algorithm with cluster analysis in modelling high dimensional data
Outerplane bipartite graphs with isomorphic resonance graphs
Boolean functions optimizing most of the cryptographic criteria
On-line arbitrarily vertex decomposable trees
The max-flow problem with parametric capacities
Subpancyclicity of line graphs and degree sums along paths
Optimal radio labellings of complete m-ary trees
An O(n 2 ) algorithm for the maximum cycle mean of an n×n bivalent matrix
Optimal L(3, 2, 1)-labeling of triangular lattice
Eccentricity approximating trees
Cops & Robber on periodic temporal graphs
Table systems with unconditional transfer
Number of lines in hypergraphs
On the general routing polytope
Edge deletion to tree-like graph classes
Relative clique number of planar signed graphs
A new class of facets for the Latin square polytope
An iterative approach to graph irregularity strength
Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach
Constrained sequence alignment: A general model and the hardness results
Continued fractions and explicit solutions of a particular discrete optimization problem
A doubly nonnegative relaxation for modularity density maximization
Terminal-pairability in complete bipartite graphs
Approximating minimum size {1, 2}-connected network
Approximation algorithms for hitting objects with straight lines
Triangle-free 2-matchings and M-concave functions on jump systems
Facial anagram-free edge-coloring of plane graphs
A construction of d z -disjunct matrices in a dual space of symplectic space
Antibandwidth and cyclic antibandwidth of Hamming graphs
Using congruence relations to extract knowledge from concept lattices
The Depth and Width of Local Minima in Discrete Solution Spaces
Connectivity preserving transformations for higher dimensional binary images
Computational analysis of counter-based schemes for VLSI test pattern generation
A polynomial algorithm for finding T-span of generalized cacti
Dominating sets of maximal outerplanar graphs
f-Factors in bipartite (mf)-graphs
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
Fragmented coloring of proper interval and split graphs
Role coloring bipartite graphs
The maximum matching extendability and factor-criticality of 1-planar graphs
Preface: CTW 2018
Maximal Path Length of Binary Trees
Record statistics in a random composition
A Graph-theoretic Result for a Model of Neural Computation
Relating the annihilation number and the total domination number of a tree
On acyclicity of games with cycles
On k-planar crossing numbers
2-piercings via graph theory
Maximum and minimum core payoffs for supermodular multisided assignment markets with local monotonicity
Autotopism stabilized colouring games on rook's graphs
Chosen IV cryptanalysis on reduced round ChaCha and Salsa
The Steiner tree in K1, r-free split graphs - A Dichotomy
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Letter graphs and geometric grid classes of permutations: Characterization and recognition
The pagenumber of k-trees is O(k)
Power languages and density
On Ramsey numbers of fans
Cyclic Graphs
On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid
Optimal Sequential Gossiping by Short Messages
On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets
Exploring Hamilton-connectedness in {K1,3,Γ0,P18}-free graphs
Minimizing bumps for posets of width two
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs
Inverted orders for monotone scoring rules
Resistance distance in complete n-partite graphs
Facets of the Generalized Permutahedron of a Poset
Avoidable vertices and edges in graphs: Existence, characterization, and applications
The k-restricted edge-connectivity of a product of graphs
Independent domination in outerplanar graphs
Preface: CALDAM 2016
On finding connected balanced partitions of trees
On (d, 2)-dominating numbers of binary undirected de Bruijn graphs
Bannai et al. method proves the d-step conjecture for strings
On the commutativity of antiblocker diagrams under lift-and-project operators
Note on two Kirchhoff index Turán problems
A note on the minimum size of matching-saturated graphs
A note on fractional ID-[a, b]-factor-critical covered graphs
Sets in Z n with distinct sums of pairs
Characterizing 5-map graphs by 2-fan-crossing graphs
Matchings in bipartite graphs with a given number of cuts
Note on Sombor index of connected graphs with given degree sequence
Upper bounds on the k-domination number and the k-Roman domination number
Degree and distance based topological descriptors of power graphs of finite non-abelian groups
On the cohomology of 3D digital images
The centdian subtree on tree networks
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
The k-rainbow bondage number of a graph
Sums of squares based approximation algorithms for MAX-SAT
Weighted Moon-type formulae for complete graphs and complete bipartite graphs
A note on geometric duality in matroid theory and knot theory
A characterization of graphs with regular distance-2 graphs
An approximation algorithm for scheduling two parallel machines with capacity constraints
Semidefinite programming for discrete optimization and matrix completion problems
The Carathéodory number of the P 3 convexity of chordal graphs
Satisfiability of mixed Horn formulas
Some approaches to a conjecture on short cycles in digraphs
Scheduling malleable tasks with interdependent processing rates: Comments and observations
Ideal clutters
Some aspects of perfect elimination orderings in chordal graphs
Strong matching preclusion under the conditional fault model
On quasi-planar graphs: Clique-width and logical description
Prescribed edges and forbidden edges for a cycle in a planar graph
Polynomial-time algorithms for special cases of the maximum confluent flow problem
Enumerating and categorizing positive Boolean functions separable by a k-additive capacity
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound
Domination versus edge domination
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
Recognizing clique graphs of directed edge path graphs
K-submodular functions and convexity of their Lovász extension
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Kemeny's constant for several families of graphs and real-world networks
The multicolored graph realization problem
A maximizing characteristic for critical configurations of chip-firing games on digraphs
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4
Computing the binding number of a graph
On variations of P 4 -sparse graphs
2-edge-Hamilton-connectedness of complete hypercube-like networks
Competition numbers of complete r-partite graphs
List injective coloring of planar graphs with girth 5, 6, 8
Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks
Short proofs on the structure of general partition, equistable and triangle graphs
Parametric Min-cuts Analysis in a Network
The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs
On the extremal graphs with respect to bond incident degree indices
A modification of the Zinoviev lower bound for constant weight codes
Graph theory and molecular distribution : Part I: copolycondensation of polyfunctional monomers bearing identical reactive groups
Roman {2}-domination
On energy and Laplacian energy of chain graphs
On plane graphs with link component number equal to the nullity
Preface: Combinatorial Optimization ISCO 2018
The interval number of a complete multipartite graph
Edge searching weighted graphs
The Mapmaker's dilemma
k-isolation in graphs
A new extended formulation of the Generalized Assignment Problem and some associated valid inequalities
The Arborescence-realization Problem
optimal Separable Partitioning in the Plane
Counting minimal semi-Sturmian words
On minimum spanning tree-like metric spaces
The L(p, q)-labelling of planar graphs without 4-cycles
A Triangle-free, 4-chromatic Q3 Euclidean distance graph Scavenger hunt!
Nonexistence of uniformly most reliable graphs of least corank
Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs
Dyck paths of knight moves
A General Label Search to investigate classical graph search algorithms
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
A family of mixed graphs with large order and diameter 2
On g-good-neighbor conditional connectivity and diagnosability of hierarchical star networks
Path finding approaches and metabolic pathways
Sign solvable graphs
Maintaining centdians in a fully dynamic forest with top trees
New results on edge-coloring and total-coloring of split graphs
Flows over edge-disjoint mixed multipaths and applications
A sufficient Q-spectral condition for a graph to be β-deficient involving minimum degree
Strongly Prime PCP Words
Quasi-optimal degree distribution for a quadratic programming problem arising from the p-version finite element method for a one-dimensional obstacle problem
The zero forcing number of claw-free cubic graphs
Improved Self-reduction Algorithms for Graphs with Bounded Treewidth
On del-robust primitive words
Small alliances in a weighted graph
The Linzertorte problem, or a unified approach to painting, baking and weaving
Conjugated trees with minimum general Randic index
From matchings to independent sets
Solving energy issues for sweep coverage in wireless sensor networks
Treelength of series-parallel graphs
An introduction to cocyclic generalised Hadamard matrices
Maximum probability shortest path problem
Resolvable configurations
The LPT heuristic for minimizing total load on a proportionate openshop
Ordering graphs with small index and its application
Properties of some ILP Formulations of a Class of Partitioning Problems
Total Balancedness Condition for Steiner Tree Games
On the average Steiner 3-eccentricity of trees
Degree diameter problem on honeycomb networks
Diameters of Cayley graphs generated by transposition trees
Diffuse reflection diameter in simple polygons
Non-hamiltonian 1-tough triangulations with disjoint separating triangles
Monge sequences and a simple assignment algorithm
The minimum ABC index of chemical trees
Matchings and Paths in the Cube
14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016)
Spectral analysis of eccentricity matrix for one-point-corona of graphs
Graph indices via the AM-GM inequality
Variation of the Wiener index under tree transformations
Selecting the top three elements
A Polynomial Approximation Scheme for the Subset Sum Problem
Edge-coloring of plane multigraphs with many colors on facial cycles
List r-dynamic coloring of graphs with small maximum average degree
Clustering and domination in perfect graphs
An improved algorithm to construct edge-independent spanning trees in augmented cubes
Underdiagonal Lattice Paths with Unrestricted Steps
Secure multi-party computation made simple
The signed domatic number of some regular graphs
Bounds on the average and minimum attendance in preference-based activity scheduling
Formulas for approximating pseudo-Boolean random variables
Complement reducible graphs
Non-adaptive prophet inequalities for minor-closed classes of matroids
Signed double Roman domination in graphs
Edge-disjoint packings of graphs
On the complexity of container stowage planning problems
Linear Trees and RNA Secondary Structure
Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
Minimum-time multidrop broadcast
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Finite metrics in switching classes
Dynamic storage allocation with known durations
Chebyshev center based column generation
1-2-3 Conjecture in digraphs: More results and directions
Total coloring of planar graphs without 6-cycles
Graft Analogue of general Kotzig-Lovász decomposition
From kernels in directed graphs to fixed points and negative cycles in Boolean networks
Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search
Linking Discrete Orthogonality with Dilation and Translation for Incomplete Sigma-pi Neural Networks of Hopfield-type
On individual leaf depths of trees
Weakly bipancyclic bipartite graphs
Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions
Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007
Edge intersection graphs of systems of paths on a grid with a bounded number of bends
Some theoretical challenges in digital geometry: A perspective
Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
Testing homotopy equivalence is isomorphism complete
Algorithms and applications for a class of bilevel MILPs
A sufficient condition for graphs to be λ k -optimal
Bisimplicial edges in bipartite graphs
A note on domination number in maximal outerplanar graphs
Steiner diameter of 3, 4 and 5-connected maximal planar graphs
(i, j) competition graphs
On the skewness of products of graphs
The basic cyclic scheduling problem with deadlines
Some results about the interval number of a graph
Bounds for probabilistic integer programming problems
Hiroyuki Nagashima and Koichi Yamazaki
Cover-incomparability graphs and chordal graphs
Computing Residual Connectedness Reliability for Restricted Networks
The challenge of characterizing branching in molecular species
On graph Laplacian eigenvectors with components in {-1, 0, 1}
Counting Bichromatic Evolutionary Trees
Eliminating graphs by means of parallel knock-out schemes
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
A general compiler for password-authenticated group key exchange protocol in the standard model
Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable
Configurations between geometry and combinatorics
Burning and w-burning of geometric graphs
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth
On full friendly index sets of 1-level and 2-levels N-grids
Perfect Latin Squares
The maximum agreement subtree problem
Matching extension in prism graphs
The Covering Radius of Hadamard Codes in Odd Graphs
New Z-cyclic triplewhist frames and triplewhist tournament designs
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
FPTAS for half-products minimization with scheduling applications
Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence
On cop-win dynamic graphs
Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases
An Algebraic Analysis of the Connectivity of DeBruijn and Shuffle-exchange Digraphs
Connection-graph and iteration-graph of monotone boolean functions
Integer and fractional security in graphs
on the Mathematical Model of Triangulanes
Quasimonotone graphs
Extremal anti-forcing numbers of perfect matchings of graphs
Minimizing the number of apertures in multileaf collimator sequencing with field splitting
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
A new neighborhood and tabu search for the Blocking Job Shop
Rime: Repeat identification
On the covering radius of cyclic linear codes and arithmetic codes
Processor Interconnection Networks from Cayley Graphs
An infinite family of 2-connected graphs that have reliability factorisations
On α-total domination in graphs
Precoloring extension on unit interval graphs
Sorting by Prefix Reversals and Prefix Transpositions
Generalized minor inequalities for the set covering polyhedron related to circulant matrices
A multivariate complexity analysis of the Generalized Noah's Ark Problem
Parametric modeling of protein-DNA binding kinetics: A discrete event based simulation approach
The Reversing Number of a Digraph
Acyclic edge coloring of planar graphs with Δ colors
A new algorithm for Boolean matrix factorization which admits overcovering
On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
Bidirectional adaptive compression
A Remark on Random 2-SAT
On the cut number problem for the 4, and 5-cubes
Coloring k-partite sparse digraphs
On the minimum number of bond-edge types and tile types: An approach by edge-colorings of graphs
Every grid has an independent [1, 2]-set
Compositional inverses and complete mappings over finite fields
Facial matchings in plane graphs
Monochromatic empty triangles in two-colored point sets
Probability of Diameter Two for Steinhaus Graphs
p -Competition Numbers
The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
Groups with the same non-commuting graph
The number of odd spanning trees in the complete graphs
Patterns in words and languages
Bounds of generalized edge-connectivity of lexicographic product graphs
The minimum identifying code graphs
A note on the orientation covering number
On the number of perfect matchings of middle graphs
Reverse Search for Enumeration
Limit cycles and update digraphs in Boolean networks
The 1-good neighbor connectivity of unidirectional star graph networks
Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds
Regularity and Locality in K-terminal Graphs
Further acceleration in computing the gap greedy spanner: An empirical approach
A Probabilistic Analysis of the Maximal Covering Location Problem
Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs
Laplacian pair state transfer in Q-graph
The k-weak Hierarchical Representations: An Extension of the Indexed Closed Weak Hierarchies
Constant work-space algorithms for facility location problems
The boundary of a graph and its isoperimetric inequality
Similarity based deduplication with small data chunks
Lift and project relaxations for the matching and related polytopes
RNA secondary structure, permutations, and statistics
Reconstructing Minimal Rooted Trees
The Median Procedure on Median Graphs
Enumeration of bipartite non-crossing geometric graphs
On the relations between SAT and CSP enumerative algorithms
Unified extremal results of topological indices and spectral invariants of graphs
Acyclic coloring of products of digraphs
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
Efficient enumeration of maximal induced bicliques
An algorithm which outputs a graph with a specified chromatic factor
Edge-disjoint paths in a grid bounded by two nested rectangles
Recursive error correction for general Reed-Muller codes
Spanning k-trees and distance signless Laplacian spectral radius of graphs
Graph Domination, Tabu Search and the Football Pool Problem
Hitting sets online and unique-max coloring
Graph connectivity and universal rigidity of bar frameworks
A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem
Bipartite multigraphs with expander-like properties
Bounds on neighborhood total domination in graphs
Choosability and paintability of the lexicographic product of graphs
Orientations with single source and sink
A family of restricted subadditive recursion
On the asymptotics of the number of binary words with a given length of a maximal series
The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
Super connectivity of folded twisted crossed cubes
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
On integer images of max-plus linear mappings
Note on E-super vertex magic graphs
The h-restricted connectivity of balanced hypercubes
Reliability analyses of regular graphs based on edge-structure connectivity
K4-free planar minimal bricks with the maximum number of edges
Service chain placement in SDNs
A Note on Approximate Inclusion-exclusion
The minimum Kirchhoff index of phenylene chains
T-choosability in Graphs
Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs
Techniques of graphs in the study of the structure of graded modules
Optimal Match-up Strategies in Stochastic Scheduling
A multi-phase constructive heuristic for the vehicle routing problem with multiple trips
An embedding technique in the study of word-representability of graphs
Wiener index and vulnerability parameters of graphs
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments