Urszula Boryczka

73 papers B 15C 2Journal 16Unranked 39

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Regression models for house price analysis. KES Urszula Boryczka, Mariusz Boryczka
2024	—	`conf`	Invigorative Art - Can a Computer Program Be Creative? ACIIDS (2) Michal Ryngier, Urszula Boryczka
2024	B	`conf`	Tuning or Control Parameter Values in Evolutionary Art. KES Michal Ryngier, Urszula Boryczka
2023	J	`jnl`	A Comparative Study of Rank Aggregation Methods in Recommendation Systems. Entropy Michal Balchanowski, Urszula Boryczka
2023	B	`conf`	ACO and generative art - artificial music. KES Urszula Boryczka, Mariusz Boryczka, Pawel Chmielarski
2023	B	`conf`	How Normalization Strategies Affect the Quality of Rank Aggregation Methods in Recommendation Systems. KES Michal Balchanowski, Urszula Boryczka
2022	B	`conf`	Collaborative Rank Aggregation in Recommendation Systems. KES Michal Balchanowski, Urszula Boryczka
2022	B	`conf`	Imperfections of Ant Sleeping Model in Clustering Problems. Critical Analysis. KES Urszula Boryczka, Mariusz Boryczka, Rafal Frelas
2022	—	`conf`	Random Forest in Whitelist-Based ATM Security. ACIIDS (2) Michal Maliszewski, Urszula Boryczka
2021	J	`jnl`	An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand. Soft Comput. Krzysztof Szwarc, Piotr Nowakowski, Urszula Boryczka
2021	J	`jnl`	Breaking Data Encryption Standard with a Reduced Number of Rounds Using Metaheuristics Differential Cryptanalysis. Entropy Kamil Dworak, Urszula Boryczka
2021	B	`conf`	Speed up Differential Evolution for ranking of items in recommendation systems. KES Urszula Boryczka, Michal Balchanowski
2021	B	`conf`	Using MajorClust Algorithm for Sandbox-based ATM Security. CEC Michal Maliszewski, Urszula Boryczka
2020	—	`conf`	Harmony Search Algorithm with Dynamic Adjustment of PAR Values for Asymmetric Traveling Salesman Problem. ACIIDS (1) Krzysztof Szwarc, Urszula Boryczka
2020	B	`conf`	Using Differential Evolution in order to create a personalized list of recommended items. KES Urszula Boryczka, Michal Balchanowski
2019	—	`conf`	A Comparative Study of Techniques for Avoiding Premature Convergence in Harmony Search Algorithm. ACIIDS (2) Krzysztof Szwarc, Urszula Boryczka
2019	J	`jnl`	A Self-Adaptive Discrete PSO Algorithm with Heterogeneous Parameter Values for Dynamic TSP. Entropy Lukasz Strak, Rafal Skinderowicz, Urszula Boryczka, Arkadiusz Nowakowski
2019	—	`conf`	Analysis of Different Approaches to Designing the Parallel Harmony Search Algorithm for ATSP. ACIIDS (2) Krzysztof Szwarc, Urszula Boryczka
2019	—	`conf`	Differential Cryptanalysis of Symmetric Block Ciphers Using Memetic Algorithms. ACIIDS (2) Kamil Dworak, Urszula Boryczka
2019	J	`jnl`	Selected variants of a Memetic Algorithm for JSP - a comparative study. Int. J. Prod. Res. Urszula Boryczka, Krzysztof Szwarc
2019	J	`jnl`	The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem. Expert Syst. Appl. Urszula Boryczka, Krzysztof Szwarc
2019	J	`jnl`	The adaptation of the harmony search algorithm to the ATSP with the evaluation of the influence of the pitch adjustment place on the quality of results. J. Inf. Telecommun. Urszula Boryczka, Krzysztof Szwarc
2018	J	`jnl`	Adjustability of a discrete particle swarm optimization for the dynamic TSP. Soft Comput. Lukasz Strak, Rafal Skinderowicz, Urszula Boryczka
2018	C	`conf`	DBSCAN Algorithm as a means to protect the ATM Systems. INISTA Michal Maliszewski, Steffen Pristerjahn, Urszula Boryczka
2018	—	`conf`	The Adaptation of the Harmony Search Algorithm to the ATSP. ACIIDS (1) Urszula Boryczka, Krzysztof Szwarc
2018	—	`conf`	Using Differential Evolution with a Simple Hybrid Feature for Personalized Recommendation. ACIIDS (1) Michal Balchanowski, Urszula Boryczka, Kamil Dworak
2017	—	`conf`	A Comparative Study of Different Variants of a Memetic Algorithm for ATSP. ICCCI (2) Krzysztof Szwarc, Urszula Boryczka
2017	C	`conf`	Basic clustering algorithms used for monitoring the processes of the ATM's OS. INISTA Michal Maliszewski, Urszula Boryczka
2017	—	`conf`	Genetic Algorithm as Optimization Tool for Differential Cryptanalysis of DES6. ICCCI (2) Kamil Dworak, Urszula Boryczka
2016	—	`conf`	Adaptive Ant Clustering Algorithm with Pheromone. ACIIDS (2) Urszula Boryczka, Jan Kozak
2016	—	`conf`	Ant Clustering Algorithm with Information Theoretic Learning. KES-IDT (1) Urszula Boryczka, Mariusz Boryczka
2016	J	`jnl`	Collective data mining in the ant colony decision tree approach. Inf. Sci. Jan Kozak, Urszula Boryczka
2016	—	`conf`	Differential Cryptanalysis of FEAL4 Using Evolutionary Algorithm. ICCCI (2) Kamil Dworak, Urszula Boryczka
2016	—	`conf`	Differential Evolution in a Recommendation System Based on Collaborative Filtering. ICCCI (2) Urszula Boryczka, Michal Balchanowski
2016	—	`conf`	The Role of Randomness in Self-aggregative AntTree Approach. ACRI Urszula Boryczka, Mariusz Boryczka
2015	—	`conf`	A New Algorithm to Categorize E-mail Messages to Folders with Social Networks Analysis. ICCCI (2) Urszula Boryczka, Barbara Probierz, Jan Kozak
2015	—	`conf`	Adaptive Ant Colony Decision Forest in Automatic Categorization of Emails. ACIIDS (1) Urszula Boryczka, Barbara Probierz, Jan Kozak
2015	—	`conf`	Cryptanalysis of SDES Using Modified Version of Binary Particle Swarm Optimization. ICCCI (2) Kamil Dworak, Urszula Boryczka
2015	—	`conf`	Diversification and Entropy Improvement on the DPSO Algorithm for DTSP. ACIIDS (1) Urszula Boryczka, Lukasz Strak
2015	J	`jnl`	Enhancing the effectiveness of Ant Colony Decision Tree algorithms by co-learning. Appl. Soft Comput. Urszula Boryczka, Jan Kozak
2015	—	`conf`	Heterogeneous DPSO Algorithm for DTSP. ICCCI (2) Urszula Boryczka, Lukasz Strak
2015	J	`jnl`	Multiple Boosting in the Ant Colony Decision Forest meta-classifier. Knowl. Based Syst. Jan Kozak, Urszula Boryczka
2014	B	`conf`	An Ant Colony Optimization Algorithm for an Automatic Categorization of Emails. ICCCI Urszula Boryczka, Barbara Probierz, Jan Kozak
2014	B	`conf`	Cryptanalysis of Transposition Cipher Using Evolutionary Algorithms. ICCCI Urszula Boryczka, Kamil Dworak
2014	—	`conf`	Genetic Transformation Techniques in Cryptanalysis. ACIIDS (2) Urszula Boryczka, Kamil Dworak
2014	B	`conf`	Goal-Oriented Requirements for ACDT Algorithms. ICCCI Jan Kozak, Urszula Boryczka
2014	—	`conf`	On-the-Go Adaptability in the New Ant Colony Decision Forest Approach. ACIIDS (2) Urszula Boryczka, Jan Kozak
2013	J	`jnl`	Corrigendum to "Finding groups in data: Cluster analysis with ants" [Appl. Soft Comput. 9(1) (2009) 61-70]. Appl. Soft Comput. Urszula Boryczka
2013	J	`jnl`	Differential Evolution as a New Method of Computing Nash Equilibria. Trans. Comput. Collect. Intell. Urszula Boryczka, Przemyslaw Juszczuk
2013	B	`conf`	Dynamic Version of the ACDT/ACDF Algorithm for H-Bond Data Set Analysis. ICCCI Jan Kozak, Urszula Boryczka
2013	B	`conf`	Efficient DPSO Neighbourhood for Dynamic Traveling Salesman Problem. ICCCI Urszula Boryczka, Lukasz Strak
2013	J	`jnl`	Heterarchy in Constructing Decision Trees - Parallel ACDT. Trans. Comput. Collect. Intell. Urszula Boryczka, Jan Kozak, Rafal Skinderowicz
2013	B	`conf`	The Differential Evolution with the Entropy Based Population Size Adjustment for the Nash Equilibria Problem. ICCCI Przemyslaw Juszczuk, Urszula Boryczka
2012	—	`conf`	A Hybrid Discrete Particle Swarm Optimization with Pheromone for Dynamic Traveling Salesman Problem. ICCCI (2) Urszula Boryczka, Lukasz Strak
2012	J	`jnl`	A new evolutionary approach for computing Nash equilibria in bimatrix games with known support. Central Eur. J. Comput. Sci. Urszula Boryczka, Przemyslaw Juszczuk
2012	—	`conf`	Ant Colony Decision Forest Meta-ensemble. ICCCI (2) Urszula Boryczka, Jan Kozak
2012	—	`conf`	New Differential Evolution Selective Mutation Operator for the Nash Equilibria Problem. ICCCI (2) Urszula Boryczka, Przemyslaw Juszczuk
2011	—	`conf`	An Adaptive Discretization in the ACDT Algorithm for Continuous Attributes. ICCCI (2) Urszula Boryczka, Jan Kozak
2011	—	`conf`	Approximate Nash Equilibria in Bimatrix Games. ICCCI (2) Urszula Boryczka, Przemyslaw Juszczuk
2011	—	`conf`	New insights of cooperation among ants in Ant Colony Decision Trees. NaBIC Urszula Boryczka, Jan Kozak
2010	—	`conf`	Ant Colony Decision Trees - A New Method for Constructing Decision Trees Based on Ant Colony Optimization. ICCCI (1) Urszula Boryczka, Jan Kozak
2010	—	`conf`	Comparative Study of the Differential Evolution and Approximation Algorithms for Computing Optimal Mixed Strategies in Zero-Sum Games. ICCCI (1) Urszula Boryczka, Przemyslaw Juszczuk
2009	—	`conf`	A New Heuristic Function in Ant-miner Approach. ICEIS (2) Urszula Boryczka, Jan Kozak
2009	—	`conf`	Cumulation of Pheromone Values in Web Searching Algorithm. ICMMI Urszula Boryczka, Iwona Polak
2009	J	`jnl`	Finding groups in data: Cluster analysis with ants. Appl. Soft Comput. Urszula Boryczka
2009	—	`ch.`	New Algorithms for Generation Decision Trees-Ant-Miner and Its Modifications. Foundations of Computational Intelligence (6) Urszula Boryczka, Jan Kozak
2007	—	`conf`	Ants and Multiple Knapsack Problem. CISIM Urszula Boryczka
2006	—	`conf`	Finding Groups in Data: Cluster Analysis with Ants. ISDA (1) Urszula Boryczka
2006	—	`conf`	The influence of trail representation in ACO for good results in MKP. ACST Urszula Boryczka
2005	—	`conf`	Ants in Web Searching Process. AWIC Urszula Boryczka
2004	—	`conf`	Ant Colony System for JSP. ACRI Urszula Boryczka
2004	—	`conf`	AntSearch - a new search algorithm. Intelligent Information Systems Urszula Boryczka
1998	—	`conf`	Learning with Delayed Rewards in Ant Systems for the Job-Shop Scheduling Problem. Rough Sets and Current Trends in Computing Urszula Boryczka

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.