![](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
Vladimir Filipovic
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
- 2023
- [j14]Simone Ciccolella
, Gianluca Della Vedova
, Vladimir Filipovic
, Mauricio Soto Gomez:
Three Metaheuristic Approaches for Tumor Phylogeny Inference: An Experimental Comparison. Algorithms 16(7): 333 (2023) - 2020
- [j13]Milan Bankovic
, Vladimir Filipovic
, Jelena Graovac, Jelena Hadzi-Puric, Ali R. Hurson
, Aleksandar Kartelj
, Jovana J. Kovacevic, Nenad Korolija
, Milos Kotlar, Nenad B. Krdzavac, Filip Maric, Sasa N. Malkov, Veljko Milutinovic, Nenad S. Mitic, Stefan Miskovic, Mladen Nikolic, Gordana Pavlovic-Lazetic, Danijela Simic
, Miodrag V. Zivkovic:
Chapter One - Teaching graduate students how to review research articles and respond to reviewer comments. Adv. Comput. 116: 1-63 (2020) - [j12]Milana Grbic, Dragan Matic, Aleksandar Kartelj, Savka Jankovic, Vladimir Filipovic
:
A three-phase method for identifying functionally related protein groups in weighted PPI networks. Comput. Biol. Chem. 86: 107246 (2020) - [j11]Milana Grbic
, Aleksandar Kartelj
, Savka Jankovic, Dragan Matic, Vladimir Filipovic
:
Variable Neighborhood Search for Partitioning Sparse Biological Networks into the Maximum Edge-Weighted $k$k-Plexes. IEEE ACM Trans. Comput. Biol. Bioinform. 17(5): 1822-1831 (2020) - 2017
- [j10]Dragan Matic, Jozef Kratica
, Vladimir Filipovic
:
Variable neighborhood search for solving bandwidth coloring problem. Comput. Sci. Inf. Syst. 14(2): 309-327 (2017) - 2014
- [j9]Aleksandar Kartelj
, Nenad S. Mitic, Vladimir Filipovic
, Dusan Tosic:
Electromagnetism-like algorithm for support vector machine parameter tuning. Soft Comput. 18(10): 1985-1998 (2014) - 2013
- [j8]Vladimir Filipovic
, Aleksandar Kartelj
, Dragan Matic:
An electromagnetism metaheuristic for solving the Maximum Betweenness Problem. Appl. Soft Comput. 13(2): 1303-1313 (2013) - 2012
- [j7]Jozef Kratica
, Tijana Kostic, Dusan Tosic, Djordje Dugosija, Vladimir Filipovic
:
A genetic algorithm for the routing and carrier selection problem. Comput. Sci. Inf. Syst. 9(1): 49-62 (2012) - [j6]Dragan Matic, Jozef Kratica, Vladimir Filipovic
, Djordje Dugosija:
Variable neighborhood search for Multiple Level Warehouse Layout Problem. Electron. Notes Discret. Math. 39: 161-168 (2012) - 2008
- [j5]Jozef Kratica, Dusan Tosic, Vladimir Filipovic:
Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm. Comput. Informatics 27(3): 341-354 (2008) - 2007
- [j4]Jozef Kratica
, Zorica Stanimirovic
, Dusan Tosic, Vladimir Filipovic
:
Two genetic algorithms for solving the uncapacitated single allocation p. Eur. J. Oper. Res. 182(1): 15-28 (2007) - 2005
- [j3]Jozef Kratica, Zorica Stanimirovic, Dusan Tosic, Vladimir Filipovic:
Genetic Algorithm for Solving Uncapacitated Multiple Allocation Hub Location Problem. Comput. Artif. Intell. 24(4): 427-440 (2005) - 2003
- [j2]Vladimir Filipovic:
Fine-grained Tournament Selection Operator in Genetic Algorithms. Comput. Artif. Intell. 22(2): 143-161 (2003) - 2001
- [j1]Jozef Kratica, Dusan Tosic, Vladimir Filipovic
, Ivana Ljubic:
Solving the simple plant location problem by genetic algorithm. RAIRO Oper. Res. 35(1): 127-142 (2001)
Conference and Workshop Papers
- 2012
- [c2]Vladimir Filipovic
, Jozef Kratica, Aleksandar Savic, Djordje Dugosija:
The modification of genetic algorithms for solving the balanced location problem. BCI 2012: 243-246 - [c1]Aleksandar Kartelj, Vladimir Filipovic, Veljko M. Milutinovic:
Novel approaches to automated personality classification: Ideas and their potentials. MIPRO 2012: 1017-1022
Informal and Other Publications
- 2022
- [i5]Vladimir Filipovic, Dragan Matic, Aleksandar Kartelj:
Solving the signed Roman domination and signed total Roman domination problems with exact and heuristic methods. CoRR abs/2201.00394 (2022) - 2020
- [i4]Aleksandar Kartelj, Vladimir Filipovic, Sinisa T. Vrecica, Rade T. Zivaljevic:
Topologically sensitive metaheuristics. CoRR abs/2002.11164 (2020) - 2019
- [i3]Jozef Kratica, Vladimir Filipovic
, Dragan Matic, Aleksandar Kartelj:
An Integer Linear Programming Formulation for the Convex Dominating Set Problems. CoRR abs/1904.02541 (2019) - 2018
- [i2]Milana Grbic, Aleksandar Kartelj, Savka Jankovic, Dragan Matic, Vladimir Filipovic:
Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted k-plexes. CoRR abs/1807.01160 (2018) - 2015
- [i1]Dragan Matic, Jozef Kratica, Vladimir Filipovic:
Variable Neighborhood Search for solving Bandwidth Coloring Problem. CoRR abs/1505.06032 (2015)
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 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint