1 citations · 1 across the 4 of their papers we have counts for
5 papers
Mapping Matchings to Minimum Vertex Covers: Kőnig's Theorem Revisited
Jacob Turner
It is a celebrated result in early combinatorics that, in bipartite graphs, the size of maximum matching is equal to the size of a minimum vertex cover. Kőnig's proof of this fact…
Combining the Connection Scan Algorithm with Contraction Hierarchies
Jacob Turner
Since the first solutions finding minimally weighted routes in weighted digraphs, a plethora of literature has appeared improving the performance of shortest-path queries for use i…
A New Optimization Layer for Real-Time Bidding Advertising Campaigns
Gianluca Micchi, Saeid Soheily-Khah, Jacob Turner
While it is relatively easy to start an online advertising campaign, obtaining a high Key Performance Indicator (KPI) can be challenging. A large body of work on this subject has a…
Enumerative Aspects of Nullstellensatz Certificates
Bart Sevenster, Jacob Turner
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper…
On Subtilings of Polyomino Tilings
Jacob Turner
We consider a problem concerning tilings of rectangular regions by a finite library of polyominoes. We specifically look at rectangular regions of dimension and ask whe…