104 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of LiverpoolGB4 papers
- Durham UniversityGB2 papers
- University of BergenNO2 papers
- Bielefeld UniversityDE1 paper
- Brandenburg University of Technology Cottbus-SenftenbergDE1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- City University of Hong KongHK1 paper
- De Montfort UniversityGB1 paper
- Heriot-Watt UniversityGB1 paper
- IIT@MITUS1 paper
- Innovation Plasturgie CompositesFR1 paper
- Institute of Computer SciencePL1 paper
15 papers
Discrimination and AI in insurance: what do people find fair? Results from a survey
Frederik Zuiderveen Borgesius, Marvin van Bekkum, Iris van Ooijen +3
Two modern trends in insurance are data-intensive underwriting and behavior-based insurance. Data-intensive underwriting means that insurers analyze more data for estimating the cl…
RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark
Federico Berto, Chuanbo Hua, Junyoung Park +30
Combinatorial optimization (CO) is fundamental to several real-world applications, from logistics and scheduling to hardware design and resource allocation. Deep reinforcement lear…
The fate of discrete torsion on resolved heterotic Z2xZ2 orbifolds using (0,2) GLSMs
A. E. Faraggi, S. Groot Nibbelink, M. Hurtado-Heredia
This paper aims to shed light on what becomes of discrete torsion within heterotic orbifolds when they are resolved to smooth geometries. Gauged Linear Sigma Models (GLSMs) possess…
Taming Triangulation Dependence of T6/Z2xZ2 Resolutions
A. E. Faraggi, S. Groot Nibbelink, M. Hurtado-Heredia
Resolutions of certain toroidal orbifolds, like T6/Z2xZ2, are far from unique, due to triangulation dependence of their resolved local singularities. This leads to an explosion of…
Constraint on Spinor-Vector Dualities in Six Dimensions
A. E. Faraggi, S. Groot Nibbelink, M. Hurtado-Heredia
Imprints of spinor-vector dualities have been uncovered in various string constructions. They are typically induced by changing certain free general GSO phases in the underlying st…
Uncovering a Spinor-Vector Duality on a Resolved Orbifold
A. E. Faraggi, S. Groot Nibbelink, M. Hurtado-Heredia
Spinor-vector dualities have been established in various exact string realisations like orbifold and free fermionic constructions. This paper aims to investigate possibility of hav…
A Worldsheet Perspective on Heterotic T-Duality Orbifolds
Stefan Groot Nibbelink
Asymmetric heterotic orbifolds are discussed from the worldsheet perspective. Starting from Buscher's gauging of a theory of D compact bosons the duality covariant description of T…
Nonexistence of locally but not globally supersymmetric orbifolds
Stefan Groot Nibbelink
Motivated by the smallness of the cosmological constant we investigate whether it is possible to have vanishing one-loop heterotic string partition functions for six-dimensional no…
Infeasibility and structural bias in Differential Evolution
Fabio Caraffini, Anna V. Kononova, David Corne
This paper thoroughly investigates a range of popular DE configurations to identify components responsible for the emergence of structural bias - recently identified tendency of th…
Verification of Shared-Reading Synchronisers
Afshin Amighi, Marieke Huisman, Stefan Blom
Synchronisation classes are an important building block for shared memory concurrent programs. Thus to reason about such programs, it is important to be able to verify the implemen…
T-duality orbifolds of heterotic Narain compactifications
Stefan Groot Nibbelink, Patrick K. S. Vaudrevange
To obtain a unified framework for symmetric and asymmetric heterotic orbifold constructions we provide a systematic study of Narain compactifications orbifolded by finite order T-d…
The Price of Connectivity for Feedback Vertex Set
Rémy Belmonte, Pim van 't Hof, Marcin Kamiński +1
Let fvs and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph , respectively. The price of connectivi…
Editing to a Planar Graph of Given Degrees
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +2
We consider the following graph modification problem. Let the input consist of a graph , a weight function , a cost function $c\colo…
Hadwiger number of graphs with small chordality
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof +1
The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph…
Maximal induced matchings in triangle-free graphs
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof +2
An induced matching in a graph is a set of edges whose endpoints induce a -regular subgraph. It is known that any -vertex graph has at most maxima…