4 papers
Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs
Michał Karpiński, Krzysztof Piecuch
In the problem of 2-coloring without monochromatic triangles (or triangle-tree 2-coloring), vertices of the simple, connected, undirected graph are colored with either 'black' or '…
CNF Encodings of Cardinality Constraints Based on Comparator Networks
Michał Karpiński
Boolean Satisfiability Problem (SAT) is one of the core problems in computer science. As one of the fundamental NP-complete problems, it can be used - by known reductions - to repr…
Experimental single-photon pulse characterization by electro-optic shearing interferometry
Alex O. C Davis, Valérian Thiel, Michał Karpiński +1
The ability to characterize the complete quantum state of light is essential for both fundamental and applied science. For single photons the quantum state is provided by the mode…
Entanglement Swapping for Generation of Heralded Time-Frequency-Entangled Photon Pairs
Dashiell L. P. Vitullo, M. G. Raymer, B. J. Smith +3
Photonic time-frequency entanglement is a promising resource for quantum information processing technologies. We investigate swapping of continuous-variable entanglement in the tim…