1.2k citations
- Center for Integrated Quantum Science and TechnologyDE57 papers
- Centre National de la Recherche ScientifiqueFR19 papers
- Helmholtz-Institute UlmDE14 papers
- Leibniz University HannoverDE14 papers
- Imperial College LondonGB13 papers
- Hebrew University of JerusalemIL12 papers
- Technische Hochschule UlmDE12 papers
- National University of SingaporeSG10 papers
- Universitat Autònoma de BarcelonaES10 papers
- Technical University of MunichDE9 papers
- University of MilanIT9 papers
- Centre for Quantum TechnologiesSG8 papers
33 papers · 1 filter
On some Graphs with a Unique Perfect Matching
S. Chaplick, M. Fürst, F. Maffray +1
We show that deciding whether a given graph of size has a unique perfect matching as well as finding that matching, if it exists, can be done in time if is eithe…
Unambiguous nuclear spin detection using engineered quantum sensing sequence
Zijun Shu, Zhendong Zhang, Qingyun Cao +9
Sensing, localising and identifying individual nuclear spins or frequency components of a signal in the presence of a noisy environments requires the development of robust and sele…
Towards an Economic Analysis of Routing in Payment Channel Networks
Felix Engelmann, Florian Glaser, Henning Kopp +2
Payment channel networks are supposed to overcome technical scalability limitations of blockchain infrastructure by employing a special overlay network with fast payment confirmati…
A lower bound on the acyclic matching number of subcubic graphs
M. Fürst, D. Rautenbach
The acyclic matching number of a graph is the largest size of an acyclic matching in , that is, a matching in such that the subgraph of induced by the vertices i…
Blackchain: Scalability for Resource-Constrained Accountable Vehicle-to-X Communication
Rens Wouter van der Heijden, Felix Engelmann, David Mödinger +2
In this paper, we propose a new Blockchain-based message and revocation accountability system called Blackchain. Combining a distributed ledger with existing mechanisms for securit…
On some hard and some tractable cases of the maximum acyclic matching problem
M. Fürst, D. Rautenbach
Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum siz…