| Publication | Date of Publication | Type |
|---|
The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs
Lecture Notes in Computer Science | 2023-08-10 | Paper |
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
Journal of Graph Algorithms and Applications | 2023-07-03 | Paper |
| 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids | 2022-07-13 | Paper |
| Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs | 2022-03-22 | Paper |
On the gracefulness of m-super subdivision of graphs
Journal of Discrete Mathematical Sciences and Cryptography | 2022-02-18 | Paper |
A generalization of Schönemann's theorem via a graph theoretic method
Discrete Mathematics | 2019-09-11 | Paper |
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes
Designs, Codes and Cryptography | 2018-07-13 | Paper |
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
International Journal of Foundations of Computer Science | 2018-05-17 | Paper |
Connecting a set of circles with minimum sum of radii
Computational Geometry | 2018-02-19 | Paper |
Connectivity graphs of uncertainty regions
Algorithmica | 2017-10-09 | Paper |
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On a restricted linear congruence
International Journal of Number Theory | 2016-11-16 | Paper |
Restricted linear congruences
Journal of Number Theory | 2016-10-26 | Paper |
Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT
Nuclear Physics B | 2016-09-16 | Paper |
On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
MMH* with arbitrary modulus is always almost-universal
Information Processing Letters | 2016-04-06 | Paper |
A framework for non-interactive instance-dependent commitment schemes (NIC)
Theoretical Computer Science | 2015-10-08 | Paper |
A model for learning the news in social networks
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
\(k\)-attribute-anonymity is hard even for \(k=2\)
Information Processing Letters | 2014-12-09 | Paper |
Linear algebraic methods in communication complexity
Linear Algebra and its Applications | 2012-05-14 | Paper |
Connecting a set of circles with minimum sum of radii
Lecture Notes in Computer Science | 2011-08-12 | Paper |
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Automata, Languages and Programming | 2007-11-28 | Paper |
| scientific article; zbMATH DE number 773987 (Why is no real title available?) | 2000-07-04 | Paper |
Coherent States for the Deformed Algebras
(available as arXiv preprint) | N/A | Paper |
