Michal Karpinski

Orcid: 0000-0002-4190-3033

According to our database1, Michal Karpinski authored at least 14 papers between 2013 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Reusing Comparator Networks in Pseudo-Boolean Encodings.
Proceedings of the 34th IEEE International Conference on Tools with Artificial Intelligence, 2022

2021
Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs.
CoRR, 2021

2020
A Two-Step Guided Waves Based Damage Localization Technique Using Optical Fiber Sensors.
Sensors, 2020

Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2019
CNF Encodings of Cardinality Constraints Based on Comparator Networks.
CoRR, 2019

Encoding cardinality constraints using multiway merge selection networks.
Constraints An Int. J., 2019

2018
Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency.
Theor. Comput. Sci., 2018

Competitive Sorter-based Encoding of PB-Constraints into SAT.
Proceedings of Pragmatics of SAT 2015, 2018

On Vertex Coloring Without Monochromatic Triangles.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete.
Theor. Comput. Sci., 2017

Encoding Cardinality Constraints using Generalized Selection Networks.
CoRR, 2017

2015
Smaller Selection Networks for Cardinality Constraints Encoding.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
Vertex 2-coloring without monochromatic cycles.
CoRR, 2014

2013
Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem.
Proceedings of the Parallel Processing and Applied Mathematics, 2013


  Loading...