The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mirka Miller: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ljiljana Brankovic, Mirka Miller, Jozef Sirán
    Towards a Practical Auditing Method for the Prevention of Statistical Database Compromise. [Citation Graph (1, 0)][DBLP]
    Australasian Database Conference, 1996, pp:177-184 [Conf]
  2. Mirka Miller, Jennifer Seberry
    Relative Compromise of Statistical Databases. [Citation Graph (1, 0)][DBLP]
    Australian Computer Journal, 1989, v:21, n:2, pp:56-61 [Journal]
  3. Hossam A. ElGindy, Michael E. Houle, William Lenhart, Mirka Miller, David Rappaport, Sue Whitesides
    Dominance Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:187-191 [Conf]
  4. Mirka Miller, Slamin
    On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:193-201 [Conf]
  5. Yingxian Jia, Zhuopeng Feng, Mirka Miller
    A Multivalued Approach to Handle Nulls in RDB. [Citation Graph (0, 0)][DBLP]
    Future Databases, 1992, pp:71-76 [Conf]
  6. François Bertault, Mirka Miller
    An Algorithm for Drawing Compound Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:197-204 [Conf]
  7. Deval Patel, Mirka Miller, Keyurkumar J. Patel
    On network security and internet vulnerability. [Citation Graph (0, 0)][DBLP]
    IADIS AC, 2005, pp:275-282 [Conf]
  8. Mauritsius Tuga, Mirka Miller
    Delta-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:216-225 [Conf]
  9. Martin Baca, Edy Tri Baskoro, Mirka Miller
    Antimagic Valuations for the Special Class of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:58-64 [Conf]
  10. Rinovia Simanjuntak, Mirka Miller
    Maximum Order of Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:159-168 [Conf]
  11. K. A. Sugeng, Mirka Miller, Slamin, Martin Baca
    (a, d)-Edge-Antimagic Total Labelings of Caterpillars. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:169-180 [Conf]
  12. Elizabeth Chang, Catherine Colman, Wan Ee, Mirka Miller
    Comparison of Industry-Sited Projects and University-Sited Projects for Final Year Students. [Citation Graph (0, 0)][DBLP]
    Software Engineering Research and Practice, 2003, pp:823-834 [Conf]
  13. Ljiljana Brankovic, Peter Norak, Mirka Miller, Graham Wrightson
    Usability of Compromise-Free Statistical Databases [Citation Graph (0, 5)][DBLP]
    SSDBM, 1997, pp:144-154 [Conf]
  14. Martin Baca, Stanislav Jendrol, Mirka Miller, Joseph F. Ryan
    Antimagic Labelings of Generalized Petersen Graphs That Are Plane. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  15. Martin Baca, Yuqing Lin, Mirka Miller, Joseph F. Ryan
    Antimagic labelings of Msbius grids. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2006, v:78, n:, pp:- [Journal]
  16. Edy Tri Baskoro, Mirka Miller, Ján Plesník
    Further results on almost Moore digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  17. Ljiljana Brankovic, Peter Horák, Mirka Miller, Alexander Rosa
    Premature partial latin squares. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  18. Yuqing Lin, Slamin, Martin Baca, Mirka Miller
    On d-antimagic labelings of prisms. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  19. Martin Sutton, Anna Draganova, Mirka Miller
    Mod sum number of wheels. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  20. Mirka Miller, Ivan Fris
    Minimum Diameter of Diregular Digraphs of Degree 2. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1988, v:31, n:1, pp:71-0 [Journal]
  21. Ljiljana Brankovic, Paulette Lieby, Mirka Miller
    Flattening Antichains with Respect to the Volume. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  22. Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joseph F. Ryan, Jozef Sirán
    A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  23. Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan
    The train marshalling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:41-54 [Journal]
  24. Elias Dahlhaus, Jan Kratochvíl, Paul D. Manuel, Mirka Miller
    Transversal Partitioning in Balanced Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:75-89 [Journal]
  25. Peter Horák, Ljiljana Brankovic, Mirka Miller
    A Combinatorial Problem in Database Security. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:119-126 [Journal]
  26. Camino Balbuena, E. Barker, K. C. Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, K. A. Sugeng, Michal Tkác
    On the degrees of a strongly vertex-magic graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:539-551 [Journal]
  27. James Boland, Fred Buckley, Mirka Miller
    Eccentric digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:1-2, pp:25-29 [Journal]
  28. Joan Gimbert, Nacho López, Mirka Miller, Joseph F. Ryan
    Characterization of eccentric digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:2, pp:210-219 [Journal]
  29. Yuqing Lin, Mirka Miller, Camino Balbuena
    Improved lower bound for the vertex connectivity of (delta;;g)-cages. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:162-171 [Journal]
  30. Mirka Miller, Joan Gimbert, Jozef Sirán, Slamin
    Almost Moore digraphs are diregular. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:265-270 [Journal]
  31. Mirka Miller, Jozef Sirán
    Digraphs of degree two which miss the Moore bound by two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:269-280 [Journal]
  32. Hiroshi Nagamochi, Mirka Miller, Slamin
    Bounds on the number of isolates in sum graph labeling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:175-185 [Journal]
  33. Martin Sutton, Mirka Miller
    On the sum number of wheels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:185-188 [Journal]
  34. Camino Balbuena, E. Barker, Yuqing Lin, Mirka Miller, K. A. Sugeng
    Consecutive magic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1817-1829 [Journal]
  35. Minh Hoang Nguyen, Mirka Miller, Joan Gimbert
    On mixed Moore graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:964-970 [Journal]
  36. Martin Baca, Stanislav Jendrol, Mirka Miller, Joseph F. Ryan
    On irregular total labellings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1378-1388 [Journal]
  37. Martin Baca, Yuqing Lin, Mirka Miller, Maged Z. Youssef
    Edge-antimagic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1232-1244 [Journal]
  38. Edy Tri Baskoro, Surahmat, S. M. Nababan, Mirka Miller
    On Ramsey Numbers for Trees Versus Wheels of Five or Six Vertices. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:4, pp:717-721 [Journal]
  39. Martin Baca, Mirka Miller, Slamin
    Vertex-Magic Total Labelings of Generalized Petersen Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:12, pp:1259-1263 [Journal]
  40. Ljiljana Brankovic, Mirka Miller, Jozef Sirán
    On Range Query Usability of Statistical Databases. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:12, pp:1265-1271 [Journal]
  41. Elias Dahlhaus, Paul D. Manuel, Mirka Miller
    Maximum h-Colourable Subgraph Problem in Balanced Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:6, pp:301-303 [Journal]
  42. Diane Donovan, Costas S. Iliopoulos, Mirka Miller
    Editorial. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:555- [Journal]
  43. Brendan D. McKay, Mirka Miller, Jozef Sirán
    A Note on Large Graphs of Diameter Two and Given Maximum Degree, . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:110-118 [Journal]
  44. Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote
    All (k;g)-cages are edge-superconnected. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:2, pp:102-110 [Journal]
  45. Peter Eades, M. Keil, Paul D. Manuel, Mirka Miller
    Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:3, pp:220-237 [Journal]
  46. Jan Kratochvíl, Paul D. Manuel, Mirka Miller
    Generalized Domination in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:1, pp:41-50 [Journal]
  47. Ljiljana Brankovic, Peter Horák, Mirka Miller
    An Optimization Problem in Statistical Databases. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:346-353 [Journal]
  48. Edy Tri Baskoro, Mirka Miller, Jozef Sirán, Martin Sutton
    Complete characterization of almost Moore digraphs of degree three. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:112-126 [Journal]
  49. Yuqing Lin, Mirka Miller, Chris Rodger
    All (k;g)-cages are k-edge-connected. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:3, pp:219-227 [Journal]
  50. Martin Sutton, Mirka Miller, Joseph F. Ryan, Slamin
    Connected graphs which are not mod sum graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:287-293 [Journal]
  51. Elias Dahlhaus, Paul D. Manuel, Mirka Miller
    A characterization of strongly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:187, n:1-3, pp:269-271 [Journal]

  52. Security of Statistical Databases: Overview and Future Directions. [Citation Graph (, )][DBLP]


  53. An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected. [Citation Graph (, )][DBLP]


  54. On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2. [Citation Graph (, )][DBLP]


  55. Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. [Citation Graph (, )][DBLP]


  56. Diameter-sufficient conditions for a graph to be super-restricted connected. [Citation Graph (, )][DBLP]


  57. Complete catalogue of graphs of maximum degree 3 and defect at most 4. [Citation Graph (, )][DBLP]


  58. On the number of components of (k, g)-cages after vertex deletion. [Citation Graph (, )][DBLP]


  59. Calculating the extremal number ex(v;{C3, C4, ..., Cn}). [Citation Graph (, )][DBLP]


  60. Enumerations of vertex orders of almost Moore digraphs with selfrepeats. [Citation Graph (, )][DBLP]


  61. Moore bound for mixed networks. [Citation Graph (, )][DBLP]


  62. Structural properties of graphs of diameter 2 with maximal repeats. [Citation Graph (, )][DBLP]


  63. On the connectivity of (k, g)-cages of even girth. [Citation Graph (, )][DBLP]


  64. Graphs of order two less than the Moore bound. [Citation Graph (, )][DBLP]


  65. On super (a, d)-edge-antimagic total labeling of disconnected graphs. [Citation Graph (, )][DBLP]


  66. On bipartite graphs of defect 2. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002