![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Michal Karpinski
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
- [j4]Rohan Soman
, Kaleeswaran Balasubramaniam
, Ali Golestani
, Michal Karpinski
, Pawel Malinowski
:
A Two-Step Guided Waves Based Damage Localization Technique Using Optical Fiber Sensors. Sensors 20(20): 5804 (2020) - 2019
- [j3]Michal Karpinski
, Marek Piotrów
:
Encoding cardinality constraints using multiway merge selection networks. Constraints An Int. J. 24(3-4): 234-251 (2019) - 2018
- [j2]Michal Karpinski
:
Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency. Theor. Comput. Sci. 707: 77-81 (2018) - 2017
- [j1]Michal Karpinski
:
Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete. Theor. Comput. Sci. 659: 88-94 (2017)
Conference and Workshop Papers
- 2022
- [c6]Michal Karpinski, Marek Piotrów
:
Reusing Comparator Networks in Pseudo-Boolean Encodings. ICTAI 2022: 760-765 - 2020
- [c5]Michal Karpinski
, Marek Piotrów
:
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks. SAT 2020: 519-535 - 2018
- [c4]Michal Karpinski
, Krzysztof Piecuch
:
On Vertex Coloring Without Monochromatic Triangles. CSR 2018: 220-231 - [c3]Michal Karpinski, Marek Piotrów
:
Competitive Sorter-based Encoding of PB-Constraints into SAT. POS@SAT 2018: 65-78 - 2015
- [c2]Michal Karpinski
, Marek Piotrów
:
Smaller Selection Networks for Cardinality Constraints Encoding. CP 2015: 210-225 - 2013
- [c1]Mieczyslaw Wodecki
, Wojciech Bozejko
, Michal Karpinski, Maciej Pacut
:
Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem. PPAM (2) 2013: 207-214
Informal and Other Publications
- 2022
- [i7]Michal Karpinski, Marek Piotrów:
Reusing Comparator Networks in Pseudo-Boolean Encodings. CoRR abs/2205.04129 (2022) - 2021
- [i6]Michal Karpinski, Krzysztof Piecuch:
Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs. CoRR abs/2110.04606 (2021) - 2019
- [i5]Michal Karpinski:
CNF Encodings of Cardinality Constraints Based on Comparator Networks. CoRR abs/1911.00586 (2019) - 2017
- [i4]Michal Karpinski, Marek Piotrów:
Encoding Cardinality Constraints using Generalized Selection Networks. CoRR abs/1704.04389 (2017) - [i3]Michal Karpinski, Krzysztof Piecuch:
On vertex coloring without monochromatic triangles. CoRR abs/1710.07132 (2017) - 2015
- [i2]Michal Karpinski, Marek Piotrów:
Smaller Selection Networks for Cardinality Constraints Encoding. CoRR abs/1502.04551 (2015) - 2014
- [i1]Michal Karpinski:
Vertex 2-coloring without monochromatic cycles. CoRR abs/1407.7423 (2014)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint