default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukasz Strak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c13]Lukasz Strak, Wojciech Wieczorek, Arkadiusz Nowakowski:
New Approaches for String Site-Removal Problem. KES 2023: 1767-1775- [c12]Arkadiusz Nowakowski, Lukasz Strak, Wojciech Wieczorek:
MAB-optimized binary PSO-based feature selection for enhanced classification performance. KES 2023: 4264-4273 - 2022
- [c11]Tarun Tater, Neelamadhav Gantayat, Sampath Dechu, Hussain Jagirdar, Harshit Rawat, Meena Guptha, Surbhi Gupta, Lukasz Strak, Shashi Kiran, Sivakumar Narayanan:
AI Driven Accounts Payable Transformation. AAAI 2022: 12405-12413 - 2021
- [j3]Wojciech Wieczorek
, Jan Kozak, Lukasz Strak, Arkadiusz Nowakowski:
Minimum Query Set for Decision Tree Construction. Entropy 23(12): 1682 (2021) - [c10]Wojciech Wieczorek, Lukasz Strak, Arkadiusz Nowakowski, Olgierd Unold:
Exact Searching for the Smallest Deterministic Automaton. ICCS (3) 2021: 50-63 - [c9]Wojciech Wieczorek, Lukasz Strak, Arkadiusz Nowakowski, Olgierd Unold:
A Toolbox for Context-Sensitive Grammar Induction by Genetic Search. ICGI 2021: 191-201 - 2020
- [c8]Wojciech Wieczorek, Lukasz Strak, Arkadiusz Nowakowski, Olgierd Unold:
Grammatical Inference by Answer Set Programming. ICCS (4) 2020: 45-58
2010 – 2019
- 2019
- [j2]Lukasz Strak, Rafal Skinderowicz, Urszula Boryczka, Arkadiusz Nowakowski:
A Self-Adaptive Discrete PSO Algorithm with Heterogeneous Parameter Values for Dynamic TSP. Entropy 21(8): 738 (2019) - 2018
- [j1]Lukasz Strak, Rafal Skinderowicz, Urszula Boryczka:
Adjustability of a discrete particle swarm optimization for the dynamic TSP. Soft Comput. 22(22): 7633-7648 (2018) - [c7]Wojciech Wieczorek, Olgierd Unold, Lukasz Strak:
Suffix Classification Trees. ICGI 2018: 44-53 - 2017
- [c6]Anna Maryniak, Lukasz Strak:
Analyses of Aspects of Knowledge Diffusion Based on the Example of the Green Supply Chain. ACIIDS (1) 2017: 335-344 - [c5]Lukasz Strak, Wojciech Wieczorek, Arkadiusz Nowakowski:
Simulated Annealing for Finding TSP Lower Bound. ICCCI (2) 2017: 45-55 - 2015
- [c4]Urszula Boryczka, Lukasz Strak:
Diversification and Entropy Improvement on the DPSO Algorithm for DTSP. ACIIDS (1) 2015: 337-347 - [c3]Urszula Boryczka, Lukasz Strak:
Heterogeneous DPSO Algorithm for DTSP. ICCCI (2) 2015: 119-128 - 2013
- [c2]Urszula Boryczka, Lukasz Strak:
Efficient DPSO Neighbourhood for Dynamic Traveling Salesman Problem. ICCCI 2013: 721-730 - 2012
- [c1]Urszula Boryczka, Lukasz Strak:
A Hybrid Discrete Particle Swarm Optimization with Pheromone for Dynamic Traveling Salesman Problem. ICCCI (2) 2012: 503-512
Coauthor Index
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 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
