Mirka Miller

According to our database1, Mirka Miller authored at least 151 papers between 1988 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Monitoring the Edges of a Graph Using Distances.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
An algebraic approach to lifts of digraphs.
Discrete Applied Mathematics, 2019

2018
On digraphs of excess one.
Discrete Applied Mathematics, 2018

2017
Approximate results for rainbow labelings.
Periodica Mathematica Hungarica, 2017

Characterisation of Graphs with Exclusive Sum Labelling.
Electronic Notes in Discrete Mathematics, 2017

A note on the locating-total domination in graphs.
Discussiones Mathematicae Graph Theory, 2017

A family of mixed graphs with large order and diameter 2.
Discrete Applied Mathematics, 2017

On the Partition Dimension of Circulant Graphs.
Comput. J., 2017

MaxDDBS problem on butterfly networks.
Australasian J. Combinatorics, 2017

2016
A construction of dense mixed graphs of diameter 2.
Electronic Notes in Discrete Mathematics, 2016

Minimum weight resolving sets of grid graphs.
Discrete Math., Alg. and Appl., 2016

A revised Moore bound for mixed graphs.
Discrete Mathematics, 2016

2015
Foreword.
Mathematics in Computer Science, 2015

Antimagicness of Generalized Corona and Snowflake Graphs.
Mathematics in Computer Science, 2015

On the Nonexistence of Almost Moore Digraphs of Degree Four and Five.
Mathematics in Computer Science, 2015

Distances of Centroid Sets in a Graph-Based Construction for Information Security Applications.
Mathematics in Computer Science, 2015

Wheels are Cycle-Antimagic.
Electronic Notes in Discrete Mathematics, 2015

Preface.
Electronic Notes in Discrete Mathematics, 2015

On the existence of radial Moore graphs for every radius and every degree.
Eur. J. Comb., 2015

Maximum incomplete recursive circulants in graph embeddings.
Discrete Math., Alg. and Appl., 2015

A Lower Bound for Dilation of an Embedding.
Comput. J., 2015

Minimum Linear Arrangement of Incomplete Hypercubes.
Comput. J., 2015

Totally antimagic total graphs.
Australasian J. Combinatorics, 2015

Trends in Temporal Reasoning: Constraints, Graphs and Posets.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014
On the partition dimension of a class of circulant graphs.
Inf. Process. Lett., 2014

Antimagicness for a family of generalized antiprism graphs.
EJGTA, 2014

On the nonexistence of almost Moore digraphs.
Eur. J. Comb., 2014

Degree diameter problem on honeycomb networks.
Discrete Applied Mathematics, 2014

Triangle randomization for social network data anonymization.
Ars Math. Contemp., 2014

On the metric dimension of circulant and Harary graphs.
Applied Mathematics and Computation, 2014

2013
Magic Labelings of Type (a, b, c) of Families of Wheels.
Mathematics in Computer Science, 2013

Stability of Hereditary Graph Classes Under Closure Operations.
Journal of Graph Theory, 2013

Bipartite Ramsey numbers involving stars, stripes and trees.
EJGTA, 2013

Preface.
Eur. J. Comb., 2013

Distance-locally disconnected graphs.
Discussiones Mathematicae Graph Theory, 2013

On large bipartite graphs of diameter 3.
Discrete Mathematics, 2013

Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes.
Discrete Mathematics, 2013

A Heuristic for Magic and Antimagic Graph Labellings
CoRR, 2013

Construction of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices.
Australasian J. Combinatorics, 2013

An Application of Completely Separating Systems to Graph Labeling.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Construction Techniques for Digraphs with Minimum Diameter.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome.
Int. J. Found. Comput. Sci., 2012

The maximum degree and diameter-bounded subgraph in the mesh.
Discrete Applied Mathematics, 2012

Antimagicness of some families of generalized graphs.
Australasian J. Combinatorics, 2012

2011
Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs.
Mathematics in Computer Science, 2011

Foreword.
Mathematics in Computer Science, 2011

Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach.
Journal of Graph Theory, 2011

All Graphs Have Antimagic Total Labelings.
Electronic Notes in Discrete Mathematics, 2011

Extremal Graphs without Cycles of Length 8 or Less.
Electronic Notes in Discrete Mathematics, 2011

On graphs of defect at most 2.
Discrete Applied Mathematics, 2011

Nonexistence of Graphs with Cyclic Defect.
Electr. J. Comb., 2011

Super edge-antimagic total labelings of mKn, n, n.
Ars Comb., 2011

On magicness and antimagicness of the union of 4-regular circulant graphs.
Australasian J. Combinatorics, 2011

2010
New Results on EX Graphs.
Mathematics in Computer Science, 2010

Foreword.
Mathematics in Computer Science, 2010

On Antimagic Labeling for Generalized Web and Flower Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
New largest known graphs of diameter 6.
Networks, 2009

On bipartite graphs of diameter 3 and defect 2.
Journal of Graph Theory, 2009

On Extremal Graphs with Bounded Girth.
Electronic Notes in Discrete Mathematics, 2009

On bipartite graphs of defect 2.
Eur. J. Comb., 2009

On super (a, d)-edge-antimagic total labeling of disconnected graphs.
Discrete Mathematics, 2009

Calculating the extremal number ex(v;{C3, C4, ..., Cn}).
Discrete Applied Mathematics, 2009

Complete catalogue of graphs of maximum degree 3 and defect at most 4.
Discrete Applied Mathematics, 2009

On the number of components of (k, g)-cages after vertex deletion.
Discrete Applied Mathematics, 2009

Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008
HSAGA and its application for the construction of near-Moore digraphs.
J. Discrete Algorithms, 2008

On consecutive edge magic total labeling of graphs.
J. Discrete Algorithms, 2008

Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia.
J. Discrete Algorithms, 2008

Moore bound for mixed networks.
Discrete Mathematics, 2008

Structural properties of graphs of diameter 2 with maximal repeats.
Discrete Mathematics, 2008

Graphs of order two less than the Moore bound.
Discrete Mathematics, 2008

On the connectivity of (k, g)-cages of even girth.
Discrete Mathematics, 2008

Enumerations of vertex orders of almost Moore digraphs with selfrepeats.
Discrete Mathematics, 2008

Diameter-sufficient conditions for a graph to be super-restricted connected.
Discrete Applied Mathematics, 2008

Antimagic labeling of the union of stars.
Australasian J. Combinatorics, 2008

Guest Editorial.
Journal of Research and Practice in Information Technology, 2008

Construction of Extremal Graphs.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007
A lower bound on the order of regular graphs with given girth pair.
Journal of Graph Theory, 2007

Futher results on sequetially additive graphs.
Discussiones Mathematicae Graph Theory, 2007

On mixed Moore graphs.
Discrete Mathematics, 2007

Edge-antimagic graphs.
Discrete Mathematics, 2007

On irregular total labellings.
Discrete Mathematics, 2007

An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

Security of Statistical Databases: Overview and Future Directions.
Proceedings of the ACSW Frontiers 2007. Proceedings of the Fifth Australasian Symposium on Grid Computing and e-Research (AusGrid 2007), the Fifth Australasian Information Security Workshop (Privacy Enhancing Technologies) (AISW 2007), and the Australasian Workshop on Health Knowledge Management and Discovery (HKMD 2007). Proceedings, Ballarat, Victoria, Australia, January 30, 2007

2006
All (k;g)-cages are edge-superconnected.
Networks, 2006

Divisibility conditions in almost Moore digraphs with selfrepeats.
Electronic Notes in Discrete Mathematics, 2006

Calculating the extremal number ex(v;{C3, C4, ..., Cn}).
Electronic Notes in Discrete Mathematics, 2006

New Largest Graphs of Diameter 6: (Extended Abstract).
Electronic Notes in Discrete Mathematics, 2006

Characterization of eccentric digraphs.
Discrete Mathematics, 2006

Consecutive magic graphs.
Discrete Mathematics, 2006

On the degrees of a strongly vertex-magic graph.
Discrete Mathematics, 2006

Antimagic labelings of Msbius grids.
Ars Comb., 2006

2005
All (k;g)-cages are k-edge-connected.
Journal of Graph Theory, 2005

Complete characterization of almost Moore digraphs of degree three.
Journal of Graph Theory, 2005

Improved lower bound for the vertex connectivity of (delta;;g)-cages.
Discrete Mathematics, 2005

Parallel algorithms for generalized clique transversal problems.
Australasian J. Combinatorics, 2005

On network security and internet vulnerability.
Proceedings of the AC 2005, 2005

2004
Eccentric digraphs.
Discrete Mathematics, 2004

On d-antimagic labelings of prisms.
Ars Comb., 2004

Antimagic Labelings of Generalized Petersen Graphs That Are Plane.
Ars Comb., 2004

2003
Editorial.
Journal of Automata, Languages and Combinatorics, 2003

Vertex-antimagic total labelings of graphs.
Discussiones Mathematicae Graph Theory, 2003

Distance magic labelings of graphs.
Australasian J. Combinatorics, 2003

Comparison of Industry-Sited Projects and University-Sited Projects for Final Year Students.
Proceedings of the International Conference on Software Engineering Research and Practice, 2003

Delta-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

(a, d)-Edge-Antimagic Total Labelings of Caterpillars.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Maximum Order of Planar Digraphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Antimagic Valuations for the Special Class of Plane Graphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002
On Range Query Usability of Statistical Databases.
Int. J. Comput. Math., 2002

Vertex-Magic Total Labelings of Generalized Petersen Graphs.
Int. J. Comput. Math., 2002

On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices.
Graphs and Combinatorics, 2002

Mod sum number of wheels.
Ars Comb., 2002

Premature partial latin squares.
Ars Comb., 2002

2001
On the sum number of wheels.
Discrete Mathematics, 2001

Bounds on the number of isolates in sum graph labeling.
Discrete Mathematics, 2001

Digraphs of degree two which miss the Moore bound by two.
Discrete Mathematics, 2001

2000
An Optimization Problem in Statistical Databases.
SIAM J. Discrete Math., 2000

Survey of certain valuations of graphs.
Discussiones Mathematicae Graph Theory, 2000

Almost Moore digraphs are diregular.
Discrete Mathematics, 2000

The train marshalling problem.
Discrete Applied Mathematics, 2000

Further results on almost Moore digraphs.
Ars Comb., 2000

Edge-magic total labelings.
Australasian J. Combinatorics, 2000

Antimagic valuations of generalized Petersen graphs.
Australasian J. Combinatorics, 2000

On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Connected graphs which are not mod sum graphs.
Discrete Mathematics, 1999

A Combinatorial Problem in Database Security.
Discrete Applied Mathematics, 1999

Flattening Antichains with Respect to the Volume.
Electr. J. Comb., 1999

Mod sum graph labelling of Hm, n and Kn.
Australasian J. Combinatorics, 1999

An Algorithm for Drawing Compound Graphs.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998
A Note on Large Graphs of Diameter Two and Given Maximum Degree, .
J. Comb. Theory, Ser. B, 1998

Maximum h-Colourable Subgraph Problem in Balanced Graphs.
Inf. Process. Lett., 1998

On the Structure of Digraphs with Order Close to the Moore Bound.
Graphs and Combinatorics, 1998

A characterization of strongly chordal graphs.
Discrete Mathematics, 1998

A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments.
Electr. J. Comb., 1998

Disjoint and unfolding domination in graphs.
Australasian J. Combinatorics, 1998

Large graphs with small degree and diameter: a voltage assignment approach.
Australasian J. Combinatorics, 1998

1997
Transversal Partitioning in Balanced Hypergraphs.
Discrete Applied Mathematics, 1997

Usability of Compromise-Free Statistical Databases
Proceedings of the Ninth International Conference on Scientific and Statistical Database Management, 1997

1996
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs.
Nord. J. Comput., 1996

Towards a Practical Auditing Method for the Prevention of Statistical Database Compromise.
Proceedings of the Proceeding Seventh Australasian Database Conference, 1996

1995
Generalized Domination in Chordal Graphs.
Nord. J. Comput., 1995

Digraphs of degree 3 and order close to the moore bound.
Journal of Graph Theory, 1995

Regular digraphs of diamter 2 and maximum order: Corrigenda.
Australasian J. Combinatorics, 1995

1994
Regular digraphs of diameter 2 and maximum order.
Australasian J. Combinatorics, 1994

1993
Dominance Drawings of Bipartite Graphs.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
A Multivalued Approach to Handle Nulls in RDB.
Proceedings of the Second Far-East Workshop on Future Database Systems 1992, 1992

1991
Digraph covering and its application to two optimization problems.
Australasian J. Combinatorics, 1991

1989
Relative Compromise of Statistical Databases.
Australian Computer Journal, 1989

1988
Minimum Diameter of Diregular Digraphs of Degree 2.
Comput. J., 1988


  Loading...