Vladimir Filipovic

Orcid: 0000-0002-5943-8037

According to our database1, Vladimir Filipovic authored at least 20 papers between 2001 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Three Metaheuristic Approaches for Tumor Phylogeny Inference: An Experimental Comparison.
Algorithms, July, 2023

2022
Solving the signed Roman domination and signed total Roman domination problems with exact and heuristic methods.
CoRR, 2022

2020
Variable Neighborhood Search for Partitioning Sparse Biological Networks into the Maximum Edge-Weighted $k$k-Plexes.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Topologically sensitive metaheuristics.
CoRR, 2020

A three-phase method for identifying functionally related protein groups in weighted PPI networks.
Comput. Biol. Chem., 2020

Chapter One - Teaching graduate students how to review research articles and respond to reviewer comments.
Adv. Comput., 2020

2019
An Integer Linear Programming Formulation for the Convex Dominating Set Problems.
CoRR, 2019

2018
Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted k-plexes.
CoRR, 2018

2017
Variable neighborhood search for solving bandwidth coloring problem.
Comput. Sci. Inf. Syst., 2017

2014
Electromagnetism-like algorithm for support vector machine parameter tuning.
Soft Comput., 2014

2013
An electromagnetism metaheuristic for solving the Maximum Betweenness Problem.
Appl. Soft Comput., 2013

2012
Variable neighborhood search for Multiple Level Warehouse Layout Problem.
Electron. Notes Discret. Math., 2012

A genetic algorithm for the routing and carrier selection problem.
Comput. Sci. Inf. Syst., 2012

Novel approaches to automated personality classification: Ideas and their potentials.
Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

The modification of genetic algorithms for solving the balanced location problem.
Proceedings of the Balkan Conference in Informatics, 2012, 2012

2008
Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm.
Comput. Informatics, 2008

2007
Two genetic algorithms for solving the uncapacitated single allocation p.
Eur. J. Oper. Res., 2007

2005
Genetic Algorithm for Solving Uncapacitated Multiple Allocation Hub Location Problem.
Comput. Artif. Intell., 2005

2003
Fine-grained Tournament Selection Operator in Genetic Algorithms.
Comput. Artif. Intell., 2003

2001
Solving the simple plant location problem by genetic algorithm.
RAIRO Oper. Res., 2001


  Loading...