yusuke1997/dblp-id-title huggingface dataset:
Jump wins Chinese Checkers tournament
Puzzling with ICCA
Computer Chess: What Remains?
Using 2048-like games as a pedagogical tool for reinforcement learning
Editorial: Looking back, looking forward
Nona Retains Her Title
ACM's 18th North American Computer Chess Championship (NACCC)
Using Bitboards for Move Generation in Shogi
Computer Checks on Human Analyses of the KRKB Endgame
Towards a Characterization of Chance in Games
Experiments in Distributing and Co-ordinating Knowledge
Micro Chess Computers
Symmetrical Chess
Comments on Barth'S Article Combining Knowledge and Search to Yield Infallible Endgame Programs
Perfect Prose
Ideas on Knowledge Synthesis Stemming from the KBBKN Endgame
Hash Tables in Cray Blitz
Cray Blitzed
The Humans versus Computers Match 1989
Experiments with Monte-Carlo Tree Search in the Game of Havannah
An Efficient Approach to Solve Mastermind Optimally
How to Play Orthogonal Central Peg English Solitaire Without a Computer
Voting for the Mephisto Award
Ludo Ergo Sum : Does Game Playing Reveal Your Personality?
Netherlands Computer-Chess Championship 1984
A Difficult Search Problem
Man vs. Machine - The Ultimate Challenge
Game Over: Black to Play and Draw in Checkers
TCGA 2012 Computer Games Tournament
Extended Futility Pruning
KQKR: Speculatively Thwarting a Human Opponent
Deep Thought Receives the Fredkin Intermediate Prize
Checking Life-and Death Problems in Go
Report on the 1st International Paderborn Computer Chess Championship
Report on the First International Conference on Computers and Games
Secrets of Pawnless Endgames
Let's Catch the Train to Monte-Carlo
Workshop on computational intelligence and games 2024
Interior-Node Score Bounds in a Brute-Force Chess Program
Data Compression in Encoding Chess Positions
Six Years as President
Checkers: A Preview of What Will Happen in Chess?
Around Kaissa
The Advanced Chess Match Between Anand and Karpov
Report on the 5 th Open Spanish Computer-Chess Championship
Is the Computer Going to Take Over from the Composer?
The Nature of Retrograde Analysis for Chinese Chess - Part 1
Chess Endgames News
Retrograde Analysis of Certain Endgames
Editorial: Stay the course
Sudoku Ripeto
My Son, the Captain
Extracting Information from Endgame Databases
Seconding a Grandmaster
Database Draw - Too Difficult?
Dieter Steinwender and Frederic A. Friedel: Schach am PC
A Review of Game-Tree Pruning
Report on the Computer Strategy-Game Programming Workshop
A Chess Composer of Two-Move Mate Problems
The Brain and Mind Sports Computer Olympiad (Part 2)
Learning in Bebe
Computing "Elo Ratings" of Move Patterns in the Game of Go
WCCC 2015: The 21 st World Computer Chess Championship
Report on the 8th World Microcomputer-Chess Championship
Reach Chess: An accidental chess variant
A polyomino puzzle for arithmetic practice
ICCA's Future
A Positional Assembly Model
PALAMEDES Wins Backgammon Tournament
Useful Statistics from Tournament Programs
A Database for KRKP
Conspiracy-Number Search
Nonogram Tournament in Olympiad Yokohama 2013
Special Issue on Computer Aided Game and Puzzle Design
Comment on 'Distributed Game-Tree Search'
80-Square Chess
Report on the 22nd ACM International Computer Chess Championship
19th World Computer-Bridge Championship
Equal Rights for Computers in Amsterdam
The 2013 World Computer Speed-Chess Championship
TAAI 2013 Computer Game Tournaments
So Help me the Database
Advances in Computer Games 2017
The Fifth World Computer-Chess Championship Announced
Life with Chessbase
Depth to Mate and the 50-Move Rule
An Explanation Tool for Chess Endgames Based on Rules
Multilevel Inference in Chinese Chess Endgame Knowledge Bases
The Relative Importance of Knowledge
A Performance Benchmarck of the Alpha-Bet a Procedure on Randomly Ordered Non-Uniform Depth-First Game-Trees Generated by a Chess Program
Alpha-Beta: A Disk Magazine
Minutes of the ICGA Triennial Meeting
Editorial: Many quests
Computer loses in king-size blunder
The 6 th GPW Cup 9x9 and 13x13 Computer Go Tournaments
Mixed logical and probabilistic reasoning in the game of Clue
Schwarzman vs. MAXIMUS: A Man-Machine Match in International Draughts
Checking Indefinitely in Chinese Chess Endgames
Yl Wins Lines of Action Tournament
The 17 th Top Chess Engine Championship, TCEC17
The Perfect 7-Piece Checkers Database
Using Games as an Experimental Testbed for AI Research
On the relative strength of different generalizations of split cuts
The complexity of 2-vertex-connected orientation in mixed graphs
Network reliability in hamiltonian graphs
Fair cost allocations under conflicts - a game-theoretic point of view -
Pareto optimal matchings of students to courses in the presence of prerequisites
The integral stable allocation problem on graphs
Polynomial kernels for deletion to classes of acyclic digraphs
Time bounds for iterative auctions: A unified approach by discrete convex analysis
Parameterized algorithms for weighted matching and packing problems
Semi-preemptive routing on a linear and circular track
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
Two-set inequalities for the binary knapsack polyhedra
Facet-defining inequalities for the simple graph partitioning polytope
Total domination and the Caccetta-Häggkvist conjecture
Fathoming rules for biobjective mixed integer linear programs: Review and extensions
The S-digraph optimization problem and the greedy algorithm
On the mixed set covering, packing and partitioning polytope
The best choice problem for upward directed graphs
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
Group sequencing around a common due date
Composite lifting of group inequalities and an application to two-row mixing inequalities
Multi-commodity variable upper bound flow models
Two-level lot-sizing with inventory bounds
Bike sharing systems: Solving the static rebalancing problem
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Reachability in choice networks
An algorithmic approach to dual integrality of matching and extensions
On the p-median polytope of Y-free graphs
Upgrading edge-disjoint paths in a ring
Multiroute flows: Cut-trees and realizability
An algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4
Convex hull results for the warehouse problem
Efficient absorbants in generalized de Bruijn digraphs
Uniform and most uniform partitions of trees
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs
The stable marriage problem with ties and restricted edges
Stable assignment with couples: Parameterized complexity and local search
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2 O( n log n )
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting
Set covering with almost consecutive ones property
A branch-and-cut algorithm for the capacitated profitable tour problem
An integer programming approach to b-coloring
Extended formulations for Gomory Corner polyhedra
EPTAS for load balancing problem on parallel machines with a non-renewable resource
A combinatorial branch-and-bound algorithm for box search
Integer programming as projection
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Greedy-type resistance of combinatorial problems
One-level reformulation of the bilevel Knapsack problem using dynamic programming
A Branch and Price algorithm for the k-splittable maximum flow problem
The inverse {0, 1}{0, 1}-knapsack problem: Theory, algorithms and computational experiments
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
A note on a polynomial time solvable case of the quadratic assignment problem
Quantitative stability analysis for vector problems of 0-1 programming
Bounded serial-batching scheduling for minimizing maximum lateness and makespan
Column (and row) generation algorithms for the pallet loading problem
Approximation algorithms for the cluster editing problem with small clusters
A bad example for the iterative rounding method for mincost k-connected spanning subgraphs
Progress on the description of identifying code polyhedra for some families of split graphs
EXPEDIS: An exact penalty method over discrete sets
Packing strong subgraph in digraphs
Mostar index and bounded maximum degree
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
Substitutes and complements in network flows viewed as discrete convexity
2-balanced flows and the inverse 1-median problem in the Chebyshev space
A PTAS for delay minimization in establishing wireless conference calls
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Total dominating sequences in trees, split graphs, and under modular decomposition
On the computability of equitable divisions
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions
The complexity of finding harmless individuals in social networks
Approximation of the Quadratic Set Covering problem
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs
Clique partitioning with value-monotone submodular cost
Combinatorial optimization with interaction costs: Complexity and solvable cases
Advances on defective parameters in graphs
A column generation approach to the discrete barycenter problem
Subexponential fixed-parameter algorithms for partial vector domination
Bilevel time minimizing transportation problem
A dual ascent procedure for the set partitioning problem
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
Improving the feasibility pump
The 2-maxian problem on cactus graphs
The Aα spectral radius and maximum outdegree of irregular digraphs
Disjoint dominating and 2-dominating sets in graphs
Tighter bounds on the minimum broadcast time
The non-stop disjoint trajectories problem
Geometric versions of the three-dimensional assignment problem under general norms
Min-max cover of a graph with a small number of parts
Online bin packing with resource augmentation
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
Geometric quadrisection in linear time, with application to VLSI placement
A study of the quadratic semi-assignment polytope
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
Complexity of training ReLU neural network
Parametric matroid interdiction
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
On cycles and the stable multi-set polytope
Using Markov chains to analyze the effectiveness of local search algorithms
On the job rotation problem
A cut-and-branch algorithm for the Quadratic Knapsack Problem
New facets of the STS polytope generated from known facets of the ATS polytope
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization
Using mixed-integer programming to solve power grid blackout problems
Graph coloring with cardinality constraints on the neighborhoods
The submodular knapsack polytope
A note on submodular function minimization by Chubanov's LP algorithm
LP-based approximation for uniform capacitated facility location problem
Perfectness of clustered graphs
On the intrinsic volumes of intersections of congruent balls
Berge's theorem for the maximum charge problem
An integral LP relaxation for a drayage problem
Hypergraphs and the Clar problem in hexagonal systems
Graphs with equal Grundy domination and independence number
On packing time-respecting arborescences
Generating functions and duality for integer programs
On some tractable and hard instances for partial incentives and target set selection
An exact algorithm for the network pricing problem
Partitioning cographs into cliques and stable sets
Parsimonious binary-encoding in integer programming
A note on independent vertex-edge domination in graphs
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra
One-way and round-trip center location problems
Extended formulations for convex hulls of some bilinear functions
More on online weighted edge coloring
An approximation scheme for the two-stage, two-dimensional knapsack problem
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs
Intersection cuts for convex mixed integer programs from translated cones
Minimum number of queries for an adaptive liar search game with small sets
Intermediate integer programming representations using value disjunctions
On the feedback vertex set polytope of a series-parallel graph
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Probabilistic characterization of random Max r-Sat
Equal opportunity networks, distance-balanced graphs, and Wiener game
A convex cover for closed unit curves has area at least 0.1
Global optimization of multilevel electricity market models including network design and graph partitioning
Pareto optimality in many-to-many matching problems
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
On the signless Laplacian spectral radius of weighted digraphs
On the NP-hardness of scheduling with time restrictions
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs
New upper bounds for online strip packing
Minimum diameter color-spanning sets revisited
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
Some cut-generating functions for second-order conic sets
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
Corrigendum to "A polyhedral study of lifted multicuts" [Discrete Optim. 47 (2023) 100757]
Courcelle's theorem - A game-theoretic approach
Nonconvex, lower semicontinuous piecewise linear optimization
Wavelength routing of uniform instances in all-optical rings
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
The quadratic minimum spanning tree problem and its variations
Polyhedral studies of vertex coloring problems: The standard formulation
Approximability results for the maximum and minimum maximal induced matching problems
Erratum to "Generating functions and duality for integer programs": [Discrete Optimization 1 (2) (2004) 167-187]
Inverse median problems
Simple lifted cover inequalities and hard knapsack problems
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Robust algorithms for total completion time
Surrogate optimization for p-norms
Lower bounds on kernelization
Iterative patching and the asymmetric traveling salesman problem
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems
The quadratic balanced optimization problem
Additive stabilizers for unstable graphs
The k-assignment polytope
A hybrid approach for biobjective optimization
A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
Hard problems on box-totally dual integral polyhedra
Symmetric ILP: Coloring and small integers
Fast lifting procedures for the bin packing problem
Trader multiflow and box-TDI systems in series-parallel graphs
The minimum weakly connected independent set problem: Polyhedral results and Branch-and-Cut
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
Stable allocations and partially ordered sets
Coordination mechanisms with hybrid local policies
Sports tournaments, home-away assignments, and the break minimization problem
Computing and minimizing the relative regret in combinatorial optimization with interval data
Fashion game on graphs
An exact approach for the Vertex Coloring Problem
Exact weighted vertex coloring via branch-and-price
Valid inequalities and branch-and-cut for the clique pricing problem
A strongly polynomial algorithm for line search in submodular polyhedra
Cardinality constrained connected balanced partitions of trees under different criteria
Submodular reassignment problem for reallocating agents to tasks with synergy effects
A revised reformulation-linearization technique for the quadratic assignment problem
A local search algorithm for binary maximum 2-path partitioning
Lower bound for 3-batched bin packing
Node-based valid inequalities for the optimal transmission switching problem
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
Single-machine common due window assignment and scheduling to minimize the total cost
An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
Asynchronous Teams for probe selection problems
Small 1-defective Ramsey numbers in perfect graphs
Algorithmic expedients for the Prize Collecting Steiner Tree Problem
Chvatal-Gomory-tier cuts for general integer programs
Cutting plane algorithms for solving a stochastic edge-partition problem
Partition inequalities for capacitated survivable network design based on directed p-cycles
Clique facets of the axial and planar assignment polytopes
The Aα-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree)
Inheritance of convexity for partition restricted games
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
Grundy dominating sequences and zero forcing sets
Mixed n-step MIR inequalities: Facets for the n-mixing set
Upper bound on 3-rainbow domination in graphs with minimum degree 2
A sequential elimination algorithm for computing bounds on the clique number of a graph
A class of valid inequalities for multilinear 0-1 optimization problems
Generalized max flow in series-parallel graphs
Complete mixed integer linear programming formulations for modularity density based clustering
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Integer programming in parameterized complexity: Five miniatures
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
Efficient approximation schemes for Economic Lot-Sizing in continuous time
CHAMP: A multipass algorithm for Max Sat based on saver variables
On inclusionwise maximal and maximum cardinality k-clubs in graphs
George B. Dantzig and systems optimization
Planar multifacility location problems with tree structure and finite dominating sets
A polynomial algorithm for the two-connections variant of the tree p-median problem
Partial multicovering and the d-consecutive ones property
Approximating the least core value and least core of cooperative games with supermodular costs
Augmenting forests to meet odd diameter requirements
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
Copositive and semidefinite relaxations of the quadratic assignment problem
On the length of L-Grundy sequences
Linear programming insights into solvable cases of the quadratic assignment problem
Approximating single- and multi-objective nonlinear sum and product knapsack problems
The Bipartite Boolean Quadric Polytope
Computational study of a branching algorithm for the maximum k-cut problem
A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions
Approximation algorithms for scheduling on multi-core processor with shared speedup resources
Generalized skew bisubmodularity: A characterization and a min-max theorem
Packing into the smallest square: Worst-case analysis of lower bounds
Intersection cuts - standard versus restricted
Star partitions on graphs
Interleaving two-phased jobs on a single machine
Facets for continuous multi-mixing set with general coefficients and bounded integer variables
Exact solution of the 2-dimensional grid arrangement problem
Two-dimensional bin packing with one-dimensional resource augmentation
Quality of equilibria for selfish bin packing with cost sharing variants
Circuit and Graver walks and linear and integer programming
Searching for realizations of finite metric spaces in tight spans
On the set covering polyhedron of circulant matrices
Integer points in the degree-sequence polytope
Circuit and bond polytopes on series-parallel graphs
On the polyhedral lift-and-project methods and the fractional stable set polytope
N-fold integer programming
A branch-and-price-and-cut method for computing an optimal bramble
On the approximability of the maximum interval constrained coloring problem
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
How tight is the corner relaxation? Insights gained from the stable set problem
The online k-server problem with rejection
Bisubmodular polyhedra, simplicial divisions, and discrete convexity
Uniform capacitated facility location with outliers/penalties
The Delivery Man Problem with time windows
On optimal randomized group testing with one defective item and a constrained number of positive responses
Spectral aspects of symmetric matrix signings
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations
On the complexity of Wafer-to-Wafer Integration
Cardinality constrained combinatorial optimization: Complexity and polyhedra
An efficient solution approach to capacitated bilevel time minimizing transportation problem
On the complexity of cake cutting
A preprocessing technique for quadratic unconstrained binary optimization
Connected matchings in chordal bipartite graphs
Packing resonant hexagons in fullerenes
The skiving stock problem and its relation to hypergraph matchings
Fractional solutions for capacitated NTU-games, with applications to stable matchings
On the circuit diameter conjecture for counterexamples to the Hirsch conjecture
A primal-dual method for approximating tree cover with two weights
On cut polytopes and graph minors
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
A criterion space search feasibility pump heuristic for solving maximum multiplicative programs
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
Bounds for online bounded space hypercube packing
Edge criticality in secure graph domination
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
A maximum edge-weight clique extraction algorithm based on branch-and-bound
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting
Blocking unions of arborescences
Relay placement for two-connectivity
Two edge modification problems without polynomial kernels
From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
Generalized min-up/min-down polytopes
Easy and hard separation of sparse and dense odd-set constraints in matching
Lattice-based algorithms for number partitioning in the hard phase
Efficient solutions for weight-balanced partitioning problems
Minimum 0-extension problems on directed metrics
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem