#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1993

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Anka Golemac
- Discrete Mathematics
- 1993

- Anka Golemac, Josko Mandic, Tanja Vucicic
- Electr. J. Comb.
- 2006

New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs. Our source are (96,20,4) regular symmetric designs.

- Anka Golemac, Josko Mandic, Tanja Vucicic
- Discrete Mathematics
- 2007

The correspondence between a (96, 20, 4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets in groups of order 96. Starting from eight such symmetric designs constructed by the tactical decomposition method, 55 inequivalent (96, 20, 4) difference sets are distinguished.… (More)

- Anka Golemac, Tanja Vucicic
- Discrete Mathematics
- 2002

All groups of type E25 · E4 are considered as possible automorphism groups of a (100; 45; 20) symmetric design. New designs are constructed, and those among them leading to Bush-type Hadamard matrices of order 100 are singled out. Further, the full automorphism groups of the constructed designs are given. c © 2002 Elsevier Science B.V. All rights reserved.

- Snježana Braić, Anka Golemac, Josko Mandic, Tanja Vucicic, Tanja Vucicic
- 2010

Using the list of 2607 so far constructed (96,20,4) difference sets as a source, we checked the related symmetric designs upon isomorphism and analyzed their full automorphism groups. New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs.

- Kako pomoći, trgovačkom putniku, Velga Bosančić, Anka Golemac, Tanja Vojkovic
- 2013

The Traveling Salesman Problem (TSP) is one of the most famous and most studied problems of combinatorial optimization. Its mathematical model consists of finding a minimum-weight Hamiltonian cycle in a weighted graph. This paper gives an overview of the TSP problem and its complexity throughout its history, variants, solution methods, and applications.

- Anka Golemac, Tanja Vucicic, Josko Mandic
- Des. Codes Cryptography
- 2005

- ‹
- 1
- ›