Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics in Computer Science, Volume 9
Volume 9, Number 1, March 2015
- Laurent Théry, Freek Wiedijk:
Foreword to the Special Focus on Formal Proofs for Mathematics and Computer Science. 1-3 - Cezary Kaliszyk
, Josef Urban:
HOL(y)Hammer: Online ATP Service for HOL Light. 5-22 - Lars Noschinski:
A Graph Library for Isabelle. 23-39 - Sylvie Boldo, Catherine Lelay, Guillaume Melquiond:
Coquelicot: A User-Friendly Library of Real Analysis for Coq. 41-62 - Matilde Marcolli, John Napp:
Quantum Computation and Real Multiplication. 63-84 - Jyoti Talwar, Ranjan Kumar Mohanty:
A Single Sweep AGE Algorithm based on Off-Step Discretization for the Solution of Viscous Burgers' Equation on a Variable Mesh. 85-103 - Jacqueline W. Daykin, Costas S. Iliopoulos, Mirka Miller, Oudone Phanalasy:
Antimagicness of Generalized Corona and Snowflake Graphs. 105-111 - Satyabrata Paul, Madhumangal Pal, Anita Pal:
L(2, 1)-Labeling of Permutation and Bipartite Permutation Graphs. 113-123
Volume 9, Number 2, June 2015
- Mirka Miller, Bharati Rajan, Indra Rajasingh:
Foreword. 125-126 - Jemal H. Abawajy, Andrei V. Kelarev, Mirka Miller, Joseph F. Ryan:
Distances of Centroid Sets in a Graph-Based Construction for Information Security Applications. 127-137 - Martin Baca, Oudone Phanalasy, Joe Ryan, Andrea Semanicová-Fenovcíková:
Antimagic Labelings of Join Graphs. 139-143 - Josep Conde, Mirka Miller, Josep M. Miret, Kumar Saurav:
On the Nonexistence of Almost Moore Digraphs of Degree Four and Five. 145-149 - Indra Rajasingh, V. Annamma:
Total Vertex Irregularity Strength of 1-Fault Tolerant Hamiltonian Graphs. 151-160 - Diari Indriati, Widodo, Indah E. Wijayanti, Kiki A. Sugeng, Martin Baca:
On Total Edge Irregularity Strength of Generalized Web Graphs and Related Graphs. 161-167 - Jasintha Quadras, Sajiya Merlin Mahizl Albert:
Domination Parameters in Coronene Torus Network. 169-175 - Jasintha Quadras, Sarah Surya Solomon:
Embedding of the Folded Hypercubes into Tori. 177-183 - J. Jeba Jesintha, K. Ezhilarasi Hilda:
All Uniform Bow Graphs are Graceful. 185-191 - M. Joice Punitha:
Strong Kernel Number in Certain Oriented Cycle Extension of Graphs. 193-199 - Paul D. Manuel, Bharati Rajan, Cyriac Grigorious, Sudeep Stephen:
On the Strong Metric Dimension of Tetrahedral Diamond Lattice. 201-208 - Paul D. Manuel, A. S. Shanthi:
Berge-Fulkerson Conjecture on Certain Snarks. 209-220 - Indra Rajasingh, Micheal Arockiaraj, Jasintha Quadras, Arul Jeya Shalini:
Linear Layout of Directed Grid Graph. 221-227 - Rismawati Ramdani, A. N. M. Salman, Hilda Assiyatun, Andrea Semanicová-Fenovcíková, Martin Baca:
Total Irregularity Strength of Three Families of Graphs. 229-237 - P. Roushini Leely Pushpam, Chitra Suseendran:
Secure Restrained Domination in Graphs. 239-247 - G. Sethuraman, A. Velankanni, S. Anbarasu, V. Vijayalakshmi:
Cycle Partition of Two-Connected and Two-Edge Connected Graphs. 249-252 - R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
Embedding of Recursive Circulants into Certain Necklace Graphs. 253-263
Volume 9, Number 3, October 2015
- Pascal Fontaine, Thomas Sturm, Uwe Waldmann:
Foreword to the Special Focus on Constraints and Combinations. 265 - Ryoya Fukasaku, Shutaro Inoue, Yosuke Sato:
On QE Algorithms over an Algebraically Closed Field Based on Comprehensive Gröbner Systems. 267-281 - Willem Hagemann:
Efficient Geometric Operations on Convex Polyhedra, with an Application to Reachability Analysis of Hybrid Systems. 283-325 - Martin Suda:
Variable and Clause Elimination for LTL Satisfiability Checking. 327-344
- Mathijs H. M. J. Wintraecken, Gert Vegter:
On the Optimal Triangulation of Convex Hypersurfaces, Whose Vertices Lie in Ambient Space. 345-353 - A. Panayotopoulos, Panayiotis M. Vlamos:
Partitioning the Meandering Curves. 355-364 - Wolfram Koepf, Etienne Nana Chiadjeu:
Algorithmic Approach for Formal Fourier Series. 365-389
Volume 9, Number 4, December 2015
- Matilde Marcolli, Alexander Port:
Graph Grammars, Insertion Lie Algebras, and Quantum Field Theory. 391-408 - Bärbel M. R. Stadler, Peter F. Stadler:
Connectivity Spaces. 409-436 - Sarah Berkemer, Ricardo Régis Cavalcante Chaves, Adrian Fritz, Marc Hellmuth, Maribel Hernandez-Rosales, Peter F. Stadler:
Spiders can be Recognized by Counting Their Legs. 437-441 - Hadi Muhshi, Edy Tri Baskoro:
Matching-Star Ramsey Minimal Graphs. 443-452 - Yiu-Kwong Man:
On Computing the Measurable Amounts of the Two Jugs Problem. 453-459 - Sandeep Ameet Kumar, Jito Vanualailai, Bibhya Sharma:
Lyapunov-Based Control for a Swarm of Planar Nonholonomic Vehicles. 461-475
a service of 
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.
last updated on 2024-06-24 20:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
