Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaffi R. Kamalian
Person information
- affiliation: National Academy of Sciences, Yerevan, of Armenia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[i25]Petros A. Petrosyan, Vahan V. Mkrtchyan, Rafayel R. Kamalian:
Graph Theory. CoRR abs/1510.00945 (2015)- 2014
- [j4]Petros A. Petrosyan
, Rafael R. Kamalian:
On sum edge-coloring of regular, bipartite and split graphs. Discret. Appl. Math. 165: 263-269 (2014) - [i24]Armen S. Asratian, Raffi R. Kamalian:
Interval colorings of edges of a multigraph. CoRR abs/1401.8079 (2014) - [i23]Hovhannes Tananyan, Rafayel R. Kamalian:
On Simultaneous 2-locally-balanced 2-partition for Two Forests with Same Vertices. CoRR abs/1405.0326 (2014) - [i22]Narine N. Davtyan, Arpine Khachatryan, Rafayel R. Kamalian:
A Description of the Subgraph Induced at a Labeling of a Graph by the Subset of Vertices with an Interval Spectrum. CoRR abs/1410.7927 (2014) - [i21]Narine N. Davtyan, Rafayel R. Kamalian:
A necessary and sufficient condition for a graph $G$, which satisfies the equality $μ_{21}(G)=|V(G)|$. CoRR abs/1412.3610 (2014) - 2013
- [i20]Rafael R. Kamalian:
Examples of cyclically-interval non-colorable bipartite graphs. CoRR abs/1305.6866 (2013) - [i19]A. M. Khachatryan, Rafayel R. Kamalian:
On the extremal values of the number of vertices with an interval spectrum on the set of proper edge colorings of the graph of the $n$-dimensional cube. CoRR abs/1307.1389 (2013) - [i18]N. N. Davtyan, R. R. Kamalian:
An inequality for the number of vertices with an interval spectrum in edge labelings of regular graphs. CoRR abs/1307.1392 (2013) - [i17]R. R. Kamalian:
Interval colorings of complete bipartite graphs and trees. CoRR abs/1308.2541 (2013) - [i16]N. N. Davtyan, R. R. Kamalian:
Some remarks on relations between the $μ$-parameters of regular graphs. CoRR abs/1308.3322 (2013) - 2012
- [j3]Rafael R. Kamalian, Petros A. Petrosyan:
A note on upper bounds for the maximum span in interval edge-colorings of graphs. Discret. Math. 312(8): 1393-1399 (2012) - [i15]Arpine Khachatryan, Rafayel R. Kamalian:
On the parameter μ21 of a complete bipartite graph. CoRR abs/1205.0125 (2012) - [i14]Rafayel R. Kamalian:
It was not known about simple cycles. CoRR abs/1205.0128 (2012) - [i13]Rafayel R. Kamalian:
On one-sided interval edge colorings of biregular bipartite graphs. CoRR abs/1205.0130 (2012) - [i12]Rafael R. Kamalian:
Estimates for the number of vertices with an interval spectrum in proper edge colorings of some graphs. CoRR abs/1205.0131 (2012) - [i11]Rafael R. Kamalian:
On cyclically-interval edge colorings of trees. CoRR abs/1205.0193 (2012) - [i10]Petros A. Petrosyan, Rafael R. Kamalian:
On sum edge-coloring of regular, bipartite and split graphs. CoRR abs/1211.5307 (2012) - 2011
- [c8]Petros A. Petrosyan, Rafael R. Kamalian:
Edge-chromatic sums of regular and bipartite graphs. CTW 2011: 227-230 - [i9]Rafayel R. Kamalian, Arpine Khachatryan:
On a property of the $n$-dimensional cube. CoRR abs/1110.6010 (2011) - 2010
- [i8]Rafael R. Kamalian, Petros A. Petrosyan:
A note on interval edge-colorings of graphs. CoRR abs/1007.1717 (2010)
2000 – 2009
- 2009
- [i7]Rafael R. Kamalian, Petros A. Petrosyan:
A note on upper bounds for the maximum span in interval edge colorings of graphs. CoRR abs/0911.5258 (2009) - 2008
- [j2]Rafael R. Kamalian, Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing. Discret. Math. 308(10): 1792-1800 (2008) - 2007
- [c7]Raffi R. Kamalian, Alice M. Agogino, Hideyuki Takagi:
Use of interactive evolutionary computation with simplified modeling for computationally expensive layout design optimization. IEEE Congress on Evolutionary Computation 2007: 4124-4129 - [i6]Rafael R. Kamalian, Vahan V. Mkrtchyan:
On complexity of special maximum matchings constructing. CoRR abs/0707.2126 (2007) - [i5]Rafael R. Kamalian, Vahan V. Mkrtchyan:
Two polynomial algorithms for special maximum matching constructing in trees. CoRR abs/0707.2295 (2007) - [i4]Rafael R. Kamalian, Vahan V. Mkrtchyan:
On a constructive characterization of a class of trees related to pairs of disjoint matchings. CoRR abs/0708.2363 (2007) - [i3]Rafael R. Kamalian, Petros A. Petrosyan:
On Lower Bound for W(K2n). CoRR abs/0712.2567 (2007) - [i2]Rafael R. Kamalian, Petros A. Petrosyan:
Interval Colourings of Some Regular Graphs. CoRR abs/0712.3150 (2007) - [i1]Rafael R. Kamalian, Petros A. Petrosyan:
On Interval Colorings of Complete k-partite Graphs K_{n}^{k}. CoRR abs/0712.3155 (2007) - 2006
- [c6]Raffi R. Kamalian, Eric Yeh, Ying Zhang, Alice M. Agogino, Hideyuki Takagi:
Reducing Human Fatigue in Interactive Evolutionary Computation Through Fuzzy Systems and Machine Learning Systems. FUZZ-IEEE 2006: 678-684 - [c5]Ying Zhang, Raffi R. Kamalian, Alice M. Agogino, Carlo H. Séquin:
Design synthesis of microelectromechanical systems using genetic algorithms with component-based genotype representation. GECCO 2006: 731-738 - [c4]Raffi R. Kamalian, Alice M. Agogino, Hideyuki Takagi:
Interactive Evolutionary CAD System for MEMS Layout Synthesis. SMC 2006: 3469-3474 - 2005
- [c3]Raffi R. Kamalian, Ying Zhang, Hideyuki Takagi, Alice M. Agogino:
Evolutionary Synthesis of Micromachines Using Supervisory Multiobjective Interactive Evolutionary Computation. ICMLC 2005: 428-437 - [c2]Raffi R. Kamalian, Alice M. Agogino:
Improving evolutionary synthesis of MEMS through fabrication and testing feedback. SMC 2005: 1908-1913 - 2004
- [c1]Raffi R. Kamalian, Hideyuki Takagi, Alice M. Agogino:
Optimized Design of MEMS by Evolutionary Multi-objective Optimization with Interactive Evolutionary Computation. GECCO (2) 2004: 1030-1041
1990 – 1999
- 1994
- [j1]Armen S. Asratian, Raffi R. Kamalian:
Investigation on Interval Edge-Colorings of Graphs. J. Comb. Theory, Ser. B 62(1): 34-43 (1994)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:43 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:
