no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A bijection between permutations and floorplans, and its applications
|
Ackerman, Eyal |
|
2006 |
31-40 |
12 |
p. 1674-1684 11 p. |
article |
2 |
A bound on the treewidth of planar even-hole-free graphs
|
Silva, Ana |
|
2010 |
31-40 |
12 |
p. 1229-1239 11 p. |
article |
3 |
A construction of d z -disjunct matrices in a dual space of symplectic space
|
Zhang, Geng-sheng |
|
2008 |
31-40 |
12 |
p. 2400-2406 7 p. |
article |
4 |
Acyclic chromatic indices of planar graphs with large girth
|
Wang, Weifan |
|
2011 |
31-40 |
12 |
p. 1239-1253 15 p. |
article |
5 |
A Lagrangian heuristic for a train-unit assignment problem
|
Cacchiani, Valentina |
|
2013 |
31-40 |
12 |
p. 1707-1718 12 p. |
article |
6 |
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
|
Panda, B.S. |
|
2013 |
31-40 |
12 |
p. 1776-1783 8 p. |
article |
7 |
Analysis of Low Hamming Weight Products
|
Cheon, Jung Hee |
|
2008 |
31-40 |
12 |
p. 2264-2269 6 p. |
article |
8 |
Analysis on the strip-based projection model for discrete tomography
|
Zhu, Jiehua |
|
2008 |
31-40 |
12 |
p. 2359-2367 9 p. |
article |
9 |
A novel use of t-packings to construct d-disjunct matrices
|
Fu, Hung-Lin |
|
2006 |
31-40 |
12 |
p. 1759-1762 4 p. |
article |
10 |
Approximating independent set in perturbed graphs
|
Manthey, Bodo |
|
2013 |
31-40 |
12 |
p. 1761-1768 8 p. |
article |
11 |
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
|
Angel, Eric |
|
2006 |
31-40 |
12 |
p. 1685-1692 8 p. |
article |
12 |
A revision and extension of results on 4-regular, 4-connected, claw-free graphs
|
Gionet Jr., Trevor J. |
|
2011 |
31-40 |
12 |
p. 1225-1230 6 p. |
article |
13 |
Bell polynomials and k -generalized Dyck paths
|
Mansour, Toufik |
|
2008 |
31-40 |
12 |
p. 2279-2292 14 p. |
article |
14 |
BerkMin: A fast and robust Sat-solver
|
Goldberg, Eugene |
|
2007 |
31-40 |
12 |
p. 1549-1561 13 p. |
article |
15 |
Bisimplicial edges in bipartite graphs
|
Bomhoff, Matthijs |
|
2013 |
31-40 |
12 |
p. 1699-1706 8 p. |
article |
16 |
Branchwidth of chordal graphs
|
Paul, Christophe |
|
2009 |
31-40 |
12 |
p. 2718-2725 8 p. |
article |
17 |
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
|
Yang, Jinn-Shyong |
|
2011 |
31-40 |
12 |
p. 1254-1263 10 p. |
article |
18 |
Characterizations of maximum fractional ( g , f ) -factors of graphs
|
Liu, Guizhen |
|
2008 |
31-40 |
12 |
p. 2293-2299 7 p. |
article |
19 |
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
|
Gurvich, Vladimir |
|
2012 |
31-40 |
12 |
p. 1742-1756 15 p. |
article |
20 |
Circular vertex arboricity
|
Wang, Guanghui |
|
2011 |
31-40 |
12 |
p. 1231-1238 8 p. |
article |
21 |
Collapsible graphs and Hamiltonian connectedness of line graphs
|
Yang, Weihua |
|
2012 |
31-40 |
12 |
p. 1837-1844 8 p. |
article |
22 |
Collective additive tree spanners for circle graphs and polygonal graphs
|
Dragan, Feodor F. |
|
2012 |
31-40 |
12 |
p. 1717-1729 13 p. |
article |
23 |
Coloring copoints of a planar point set
|
Morris, Walter |
|
2006 |
31-40 |
12 |
p. 1742-1752 11 p. |
article |
24 |
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
|
Yedidsion, Liron |
|
2011 |
31-40 |
12 |
p. 1264-1278 15 p. |
article |
25 |
Complexity results related to monophonic convexity
|
Dourado, Mitre C. |
|
2010 |
31-40 |
12 |
p. 1268-1274 7 p. |
article |
26 |
Computing branchwidth via efficient triangulations and blocks
|
Fomin, Fedor V. |
|
2009 |
31-40 |
12 |
p. 2726-2736 11 p. |
article |
27 |
Conflict-directed A* and its role in model-based embedded systems
|
Williams, Brian C. |
|
2007 |
31-40 |
12 |
p. 1562-1595 34 p. |
article |
28 |
Connected graph searching in chordal graphs
|
Nisse, Nicolas |
|
2009 |
31-40 |
12 |
p. 2603-2610 8 p. |
article |
29 |
Connections in Combinatorial Optimization
|
Frank, András |
|
2012 |
31-40 |
12 |
p. 1875- 1 p. |
article |
30 |
Contents
|
|
|
2009 |
31-40 |
12 |
p. v-vi nvt p. |
article |
31 |
Contents
|
|
|
2010 |
31-40 |
12 |
p. v-vi nvt p. |
article |
32 |
Contents
|
|
|
2006 |
31-40 |
12 |
p. vii- 1 p. |
article |
33 |
Contents
|
|
|
2007 |
31-40 |
12 |
p. v- 1 p. |
article |
34 |
Contents
|
|
|
2008 |
31-40 |
12 |
p. vii-viii nvt p. |
article |
35 |
Contents
|
|
|
2013 |
31-40 |
12 |
p. v-vi nvt p. |
article |
36 |
Contents
|
|
|
2011 |
31-40 |
12 |
p. v- 1 p. |
article |
37 |
Contents
|
|
|
2012 |
31-40 |
12 |
p. v-vi nvt p. |
article |
38 |
Convex drawings of graphs with non-convex boundary constraints
|
Hong, Seok-Hee |
|
2008 |
31-40 |
12 |
p. 2368-2380 13 p. |
article |
39 |
Decompositions for edge-coloring join graphs and cobipartite graphs
|
Machado, Raphael C.S. |
|
2010 |
31-40 |
12 |
p. 1336-1342 7 p. |
article |
40 |
Dichotomy for tree-structured trigraph list homomorphism problems
|
Feder, Tomás |
|
2011 |
31-40 |
12 |
p. 1217-1224 8 p. |
article |
41 |
Discovering all associations in discrete data using frequent minimally infrequent attribute sets
|
Eisenschmidt, Elke |
|
2012 |
31-40 |
12 |
p. 1730-1741 12 p. |
article |
42 |
Distance constrained labelings of planar graphs with no short cycles
|
Dvořák, Zdeněk |
|
2009 |
31-40 |
12 |
p. 2634-2645 12 p. |
article |
43 |
Distance with generalized neighbourhood sequences in n D and ∞ D
|
Nagy, Benedek |
|
2008 |
31-40 |
12 |
p. 2344-2351 8 p. |
article |
44 |
Editorial Board
|
|
|
2006 |
31-40 |
12 |
p. v-vi nvt p. |
article |
45 |
Editorial Board
|
|
|
2008 |
31-40 |
12 |
p. v-vi nvt p. |
article |
46 |
Embedding graphs as isometric medians
|
Dankelmann, P. |
|
2008 |
31-40 |
12 |
p. 2420-2422 3 p. |
article |
47 |
Equivalence of permutation polytopes corresponding to strictly supermodular functions
|
Hwang, Frank K. |
|
2008 |
31-40 |
12 |
p. 2336-2343 8 p. |
article |
48 |
E -super vertex magic labelings of graphs
|
Marimuthu, G. |
|
2012 |
31-40 |
12 |
p. 1766-1774 9 p. |
article |
49 |
Expected number of breakpoints after t random reversals in genomes with duplicate genes
|
Eriksen, Niklas |
|
2008 |
31-40 |
12 |
p. 2320-2335 16 p. |
article |
50 |
Exploiting partial knowledge of satisfying assignments
|
Iwama, Kazuo |
|
2007 |
31-40 |
12 |
p. 1596-1603 8 p. |
article |
51 |
Fast algorithms for identifying maximal common connected sets of interval graphs
|
Coulon, Fabien |
|
2006 |
31-40 |
12 |
p. 1709-1721 13 p. |
article |
52 |
Finding the longest isometric cycle in a graph
|
Lokshtanov, Daniel |
|
2009 |
31-40 |
12 |
p. 2670-2674 5 p. |
article |
53 |
Fully dynamic recognition algorithm and certificate for directed cographs
|
Crespelle, C. |
|
2006 |
31-40 |
12 |
p. 1722-1741 20 p. |
article |
54 |
Generalized power domination of graphs
|
Chang, Gerard Jennhwa |
|
2012 |
31-40 |
12 |
p. 1691-1698 8 p. |
article |
55 |
Generating effective symmetry-breaking predicates for search problems
|
Shlyakhter, Ilya |
|
2007 |
31-40 |
12 |
p. 1539-1548 10 p. |
article |
56 |
Graph labellings with variable weights, a survey
|
Griggs, Jerrold R. |
|
2009 |
31-40 |
12 |
p. 2646-2658 13 p. |
article |
57 |
Graph models and their efficient implementation for sparse Jacobian matrix determination
|
Hossain, Shahadat |
|
2013 |
31-40 |
12 |
p. 1747-1754 8 p. |
article |
58 |
Greedy colorings of words
|
Rautenbach, Dieter |
|
2012 |
31-40 |
12 |
p. 1872-1874 3 p. |
article |
59 |
Guest editors’ foreword
|
Kratochvíl, Jan |
|
2009 |
31-40 |
12 |
p. 2575-2576 2 p. |
article |
60 |
Guest Editors Listing
|
|
|
2007 |
31-40 |
12 |
p. 1513- 1 p. |
article |
61 |
Guide for authors
|
|
|
2006 |
31-40 |
12 |
p. I-IV nvt p. |
article |
62 |
Homomorphisms of 2-edge-colored graphs
|
Montejano, Amanda |
|
2010 |
31-40 |
12 |
p. 1365-1379 15 p. |
article |
63 |
Hosoya polynomials under gated amalgamations
|
Xu, Shoujun |
|
2008 |
31-40 |
12 |
p. 2407-2419 13 p. |
article |
64 |
Hypergraphs with large domination number and with edge sizes at least three
|
Henning, Michael A. |
|
2012 |
31-40 |
12 |
p. 1757-1765 9 p. |
article |
65 |
Impact of memory size on graph exploration capability
|
Fraigniaud, Pierre |
|
2008 |
31-40 |
12 |
p. 2310-2319 10 p. |
article |
66 |
Labelling planar graphs without 4-cycles with a condition on distance two
|
Wang, Weifan |
|
2008 |
31-40 |
12 |
p. 2241-2249 9 p. |
article |
67 |
Limited packings in graphs
|
Gallant, Robert |
|
2010 |
31-40 |
12 |
p. 1357-1364 8 p. |
article |
68 |
Linear delay enumeration and monadic second-order logic
|
Courcelle, Bruno |
|
2009 |
31-40 |
12 |
p. 2675-2700 26 p. |
article |
69 |
L ( 2 , 1 ) -labeling of oriented planar graphs
|
Calamoneri, T. |
|
2013 |
31-40 |
12 |
p. 1719-1725 7 p. |
article |
70 |
Locally monotone Boolean and pseudo-Boolean functions
|
Couceiro, Miguel |
|
2012 |
31-40 |
12 |
p. 1651-1660 10 p. |
article |
71 |
Local maximum stable set greedoids stemming from very well-covered graphs
|
Levit, Vadim E. |
|
2012 |
31-40 |
12 |
p. 1864-1871 8 p. |
article |
72 |
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
|
Cheng, Eddie |
|
2012 |
31-40 |
12 |
p. 1699-1716 18 p. |
article |
73 |
M 2 -equipackable graphs
|
Zhang, Yuqin |
|
2006 |
31-40 |
12 |
p. 1766-1770 5 p. |
article |
74 |
Minimal split completions
|
Heggernes, Pinar |
|
2009 |
31-40 |
12 |
p. 2659-2669 11 p. |
article |
75 |
Minimum cost homomorphisms to semicomplete multipartite digraphs
|
Gutin, Gregory |
|
2008 |
31-40 |
12 |
p. 2429-2435 7 p. |
article |
76 |
Minimum k -path vertex cover
|
Brešar, Boštjan |
|
2011 |
31-40 |
12 |
p. 1189-1195 7 p. |
article |
77 |
Minimum sum edge colorings of multicycles
|
Cardinal, Jean |
|
2010 |
31-40 |
12 |
p. 1216-1223 8 p. |
article |
78 |
Minors of simplicial complexes
|
Kaiser, Tomáš |
|
2009 |
31-40 |
12 |
p. 2597-2602 6 p. |
article |
79 |
Mixed fault diameter of Cartesian graph bundles
|
Erveš, Rija |
|
2013 |
31-40 |
12 |
p. 1726-1733 8 p. |
article |
80 |
New bounds on binary identifying codes
|
Exoo, Geoffrey |
|
2008 |
31-40 |
12 |
p. 2250-2263 14 p. |
article |
81 |
New Z-cyclic triplewhist frames and triplewhist tournament designs
|
Abel, R. Julian R. |
|
2006 |
31-40 |
12 |
p. 1649-1673 25 p. |
article |
82 |
Number-theoretic interpretation and construction of a digital circle
|
Bhowmick, Partha |
|
2008 |
31-40 |
12 |
p. 2381-2399 19 p. |
article |
83 |
On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3
|
Nishimura, Shigeto |
|
2008 |
31-40 |
12 |
p. 2352-2358 7 p. |
article |
84 |
On basic forbidden patterns of functions
|
Elizalde, Sergi |
|
2011 |
31-40 |
12 |
p. 1207-1216 10 p. |
article |
85 |
On chromatic and flow polynomial unique graphs
|
Duan, Yinghua |
|
2008 |
31-40 |
12 |
p. 2300-2309 10 p. |
article |
86 |
On error-tolerant DNA screening
|
Wu, Weili |
|
2006 |
31-40 |
12 |
p. 1753-1758 6 p. |
article |
87 |
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
|
Alcón, L. |
|
2010 |
31-40 |
12 |
p. 1279-1285 7 p. |
article |
88 |
On minimizing the number of ADMs in a general topology optical network
|
Flammini, Michele |
|
2009 |
31-40 |
12 |
p. 2701-2717 17 p. |
article |
89 |
On multicolour noncomplete Ramsey graphs of star graphs
|
Gautam, Sachin |
|
2008 |
31-40 |
12 |
p. 2423-2428 6 p. |
article |
90 |
On packing and covering polyhedra of consecutive ones circulant clutters
|
Aguilera, Néstor E. |
|
2010 |
31-40 |
12 |
p. 1343-1356 14 p. |
article |
91 |
On probe permutation graphs
|
Chandler, David B. |
|
2009 |
31-40 |
12 |
p. 2611-2619 9 p. |
article |
92 |
On the approximability of some degree-constrained subgraph problems
|
Amini, Omid |
|
2012 |
31-40 |
12 |
p. 1661-1679 19 p. |
article |
93 |
On the binary projective codes with dimension 6
|
Bouyukliev, Iliya |
|
2006 |
31-40 |
12 |
p. 1693-1708 16 p. |
article |
94 |
On the ( h , k ) -domination numbers of iterated line digraphs
|
Hasunuma, Toru |
|
2012 |
31-40 |
12 |
p. 1859-1863 5 p. |
article |
95 |
On the packing chromatic number of some lattices
|
Finbow, Arthur S. |
|
2010 |
31-40 |
12 |
p. 1224-1228 5 p. |
article |
96 |
On the structure of the adjacency matrix of the line digraph of a regular digraph
|
Severini, Simone |
|
2006 |
31-40 |
12 |
p. 1763-1765 3 p. |
article |
97 |
Packing paths: Recycling saves time
|
Binkele-Raible, Daniel |
|
2013 |
31-40 |
12 |
p. 1686-1698 13 p. |
article |
98 |
Partitioning graphs of supply and demand
|
Ito, Takehiro |
|
2009 |
31-40 |
12 |
p. 2620-2633 14 p. |
article |
99 |
Partition into cliques for cubic graphs: Planar case, complexity and approximation
|
Cerioli, M.R. |
|
2008 |
31-40 |
12 |
p. 2270-2278 9 p. |
article |
100 |
Phase transitions of PP-complete satisfiability problems
|
Bailey, Delbert D. |
|
2007 |
31-40 |
12 |
p. 1627-1639 13 p. |
article |
101 |
Prescribed edges and forbidden edges for a cycle in a planar graph
|
Göring, Frank |
|
2013 |
31-40 |
12 |
p. 1734-1738 5 p. |
article |
102 |
Rainbow connection and minimum degree
|
Schiermeyer, Ingo |
|
2013 |
31-40 |
12 |
p. 1784-1787 4 p. |
article |
103 |
Random backtracking in backtrack search algorithms for satisfiability
|
Lynce, I. |
|
2007 |
31-40 |
12 |
p. 1604-1612 9 p. |
article |
104 |
Recent developments on graphs of bounded clique-width
|
Kamiński, Marcin |
|
2009 |
31-40 |
12 |
p. 2747-2761 15 p. |
article |
105 |
Recognizing near-bipartite Pfaffian graphs in polynomial time
|
Miranda, Alberto Alexandre Assis |
|
2010 |
31-40 |
12 |
p. 1275-1278 4 p. |
article |
106 |
Rectilinear paths with minimum segment lengths
|
Maßberg, Jens |
|
2013 |
31-40 |
12 |
p. 1769-1775 7 p. |
article |
107 |
Regular-SAT: A many-valued approach to solving combinatorial problems
|
Béjar, Ramón |
|
2007 |
31-40 |
12 |
p. 1613-1626 14 p. |
article |
108 |
Repetition-free longest common subsequence
|
Adi, Said S. |
|
2010 |
31-40 |
12 |
p. 1315-1324 10 p. |
article |
109 |
Restricted vertex multicut on permutation graphs
|
Papadopoulos, Charis |
|
2012 |
31-40 |
12 |
p. 1791-1797 7 p. |
article |
110 |
Self-inverse Sheffer sequences and Riordan involutions
|
Luzón, Ana |
|
2011 |
31-40 |
12 |
p. 1290-1292 3 p. |
article |
111 |
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
|
Dorn, Frederic |
|
2009 |
31-40 |
12 |
p. 2737-2746 10 p. |
article |
112 |
Some bounds on global alliances in trees
|
Harutyunyan, Ararat |
|
2013 |
31-40 |
12 |
p. 1739-1746 8 p. |
article |
113 |
Some remarks on inverse Wiener index problem
|
Fink, Jiří |
|
2012 |
31-40 |
12 |
p. 1851-1858 8 p. |
article |
114 |
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
|
Meierling, Dirk |
|
2012 |
31-40 |
12 |
p. 1775-1781 7 p. |
article |
115 |
3-symmetric and 3-decomposable geometric drawings of K n
|
Ábrego, B.M. |
|
2010 |
31-40 |
12 |
p. 1240-1258 19 p. |
article |
116 |
9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)
|
Faigle, Ulrich |
|
2013 |
31-40 |
12 |
p. 1673- 1 p. |
article |
117 |
The C k -extended graft construction
|
MacGillivray, Gary |
|
2011 |
31-40 |
12 |
p. 1293-1301 9 p. |
article |
118 |
The clique operator on circular-arc graphs
|
Lin, Min Chih |
|
2010 |
31-40 |
12 |
p. 1259-1267 9 p. |
article |
119 |
The competition number of the complement of a cycle
|
Kim, Suh-Ryung |
|
2013 |
31-40 |
12 |
p. 1755-1760 6 p. |
article |
120 |
The complexity of surjective homomorphism problems—a survey
|
Bodirsky, Manuel |
|
2012 |
31-40 |
12 |
p. 1680-1690 11 p. |
article |
121 |
The folk solution and Boruvka’s algorithm in minimum cost spanning tree problems
|
Bergantiños, Gustavo |
|
2011 |
31-40 |
12 |
p. 1279-1283 5 p. |
article |
122 |
The hamiltonicity and path t -coloring of Sierpiński-like graphs
|
Xue, Bing |
|
2012 |
31-40 |
12 |
p. 1822-1836 15 p. |
article |
123 |
The k -Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
|
Quintão, Frederico P. |
|
2010 |
31-40 |
12 |
p. 1305-1314 10 p. |
article |
124 |
The L ( 2 , 1 ) -labeling of unigraphs
|
Calamoneri, Tiziana |
|
2011 |
31-40 |
12 |
p. 1196-1206 11 p. |
article |
125 |
The maximum degree and diameter-bounded subgraph in the mesh
|
Miller, Mirka |
|
2012 |
31-40 |
12 |
p. 1782-1790 9 p. |
article |
126 |
The nonidealness index of rank-ideal matrices
|
Argiroffo, Gabriela R. |
|
2010 |
31-40 |
12 |
p. 1325-1335 11 p. |
article |
127 |
The Northwest corner rule revisited
|
Klinz, Bettina |
|
2011 |
31-40 |
12 |
p. 1284-1289 6 p. |
article |
128 |
The polynomial dichotomy for three nonempty part sandwich problems
|
Teixeira, Rafael B. |
|
2010 |
31-40 |
12 |
p. 1286-1304 19 p. |
article |
129 |
The state of SAT
|
Kautz, Henry |
|
2007 |
31-40 |
12 |
p. 1514-1524 11 p. |
article |
130 |
The Traveling Salesman Problem with flexible coloring
|
Roemer, Thomas A. |
|
2012 |
31-40 |
12 |
p. 1798-1814 17 p. |
article |
131 |
The unsatisfiability threshold revisited
|
Kaporis, Alexis C. |
|
2007 |
31-40 |
12 |
p. 1525-1538 14 p. |
article |
132 |
Total colorings of planar graphs without intersecting 5-cycles
|
Wang, Bing |
|
2012 |
31-40 |
12 |
p. 1815-1821 7 p. |
article |
133 |
Traces from LAGOS’07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007
|
Durán, Guillermo |
|
2010 |
31-40 |
12 |
p. 1213-1215 3 p. |
article |
134 |
Tree-width of graphs without a 3×3 grid minor
|
Birmelé, E. |
|
2009 |
31-40 |
12 |
p. 2577-2596 20 p. |
article |
135 |
Upper bounds on the Steiner diameter of a graph
|
Ali, Patrick |
|
2012 |
31-40 |
12 |
p. 1845-1850 6 p. |
article |
136 |
Watching systems in graphs: An extension of identifying codes
|
Auger, David |
|
2013 |
31-40 |
12 |
p. 1674-1685 12 p. |
article |